Base | Representation |
---|---|
bin | 10010111011111100001… |
… | …011111110001010001001 |
3 | 11121101220121110020202111 |
4 | 102323330023332022021 |
5 | 132310041121320014 |
6 | 2433451501302321 |
7 | 163005463004605 |
oct | 22737413761211 |
9 | 4541817406674 |
10 | 1301311120009 |
11 | 46197922504a |
12 | 1902525649a1 |
13 | 959369269b4 |
14 | 46dab762505 |
15 | 23cb40b02c4 |
hex | 12efc2fe289 |
1301311120009 has 2 divisors, whose sum is σ = 1301311120010. Its totient is φ = 1301311120008.
The previous prime is 1301311119973. The next prime is 1301311120037. The reversal of 1301311120009 is 9000211131031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 894165033609 + 407146086400 = 945603^2 + 638080^2 .
It is a cyclic number.
It is not a de Polignac number, because 1301311120009 - 211 = 1301311117961 is a prime.
It is not a weakly prime, because it can be changed into another prime (1301311120049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650655560004 + 650655560005.
It is an arithmetic number, because the mean of its divisors is an integer number (650655560005).
Almost surely, 21301311120009 is an apocalyptic number.
It is an amenable number.
1301311120009 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301311120009 is an equidigital number, since it uses as much as digits as its factorization.
1301311120009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 22.
The spelling of 1301311120009 in words is "one trillion, three hundred one billion, three hundred eleven million, one hundred twenty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •