Base | Representation |
---|---|
bin | 10011000100000010010… |
… | …000101010011011110101 |
3 | 11122020100100122212000101 |
4 | 103010002100222123311 |
5 | 132430341223312304 |
6 | 2441450153314101 |
7 | 163434044221522 |
oct | 23040220523365 |
9 | 4566310585011 |
10 | 1310002947829 |
11 | 46562956aa24 |
12 | 191a79405931 |
13 | 966c05a7594 |
14 | 47593c78149 |
15 | 241221b68a4 |
hex | 1310242a6f5 |
1310002947829 has 2 divisors, whose sum is σ = 1310002947830. Its totient is φ = 1310002947828.
The previous prime is 1310002947809. The next prime is 1310002947889. The reversal of 1310002947829 is 9287492000131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1190667245329 + 119335702500 = 1091177^2 + 345450^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310002947829 - 25 = 1310002947797 is a prime.
It is a super-2 number, since 2×13100029478292 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310002947809) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655001473914 + 655001473915.
It is an arithmetic number, because the mean of its divisors is an integer number (655001473915).
Almost surely, 21310002947829 is an apocalyptic number.
It is an amenable number.
1310002947829 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310002947829 is an equidigital number, since it uses as much as digits as its factorization.
1310002947829 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 217728, while the sum is 46.
The spelling of 1310002947829 in words is "one trillion, three hundred ten billion, two million, nine hundred forty-seven thousand, eight hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •