Base | Representation |
---|---|

bin | 100001001101100101… |

… | …010010111101110101 |

3 | 10102001022010211200122 |

4 | 201031211102331311 |

5 | 1041013302023023 |

6 | 24214350421325 |

7 | 2401502365355 |

oct | 411545227565 |

9 | 112038124618 |

10 | 35661361013 |

11 | 1413a9aa393 |

12 | 6ab2b01845 |

13 | 3494254b65 |

14 | 1a242a6b65 |

15 | ddab6e2c8 |

hex | 84d952f75 |

35661361013 has 6 divisors (see below), whose sum is σ = 36552366402. Its totient is φ = 34791570080.

The previous prime is 35661360997. The next prime is 35661361051. The reversal of 35661361013 is 31016316653.

It can be written as a sum of positive squares in 3 ways, for example, as 3080028004 + 32581333009 = 55498^2 + 180503^2 .

It is not a de Polignac number, because 35661361013 - 2^{4} = 35661360997 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (35661361063) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10605506 + ... + 10608867.

It is an arithmetic number, because the mean of its divisors is an integer number (6092061067).

Almost surely, 2^{35661361013} is an apocalyptic number.

It is an amenable number.

35661361013 is a deficient number, since it is larger than the sum of its proper divisors (891005389).

35661361013 is an equidigital number, since it uses as much as digits as its factorization.

35661361013 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 21214455 (or 21214414 counting only the distinct ones).

The product of its (nonzero) digits is 29160, while the sum is 35.

Adding to 35661361013 its reverse (31016316653), we get a palindrome (66677677666).

The spelling of 35661361013 in words is "thirty-five billion, six hundred sixty-one million, three hundred sixty-one thousand, thirteen".

• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •