Base | Representation |
---|---|
bin | 10110101111011110111000… |
… | …101000010111100100101101 |
3 | 111010010211002211202012202102 |
4 | 112233132320220113210231 |
5 | 101102211430224341023 |
6 | 552420315405504445 |
7 | 30032130603012515 |
oct | 2657367050274455 |
9 | 433124084665672 |
10 | 100020001012013 |
11 | 29962276067575 |
12 | b274667b72125 |
13 | 43a6acbab63b4 |
14 | 1a9adcb2bc845 |
15 | b86b3a68a628 |
hex | 5af7b8a1792d |
100020001012013 has 2 divisors, whose sum is σ = 100020001012014. Its totient is φ = 100020001012012.
The previous prime is 100020001011989. The next prime is 100020001012021. The reversal of 100020001012013 is 310210100020001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 68369779034404 + 31650221977609 = 8268602^2 + 5625853^2 .
It is a cyclic number.
It is not a de Polignac number, because 100020001012013 - 28 = 100020001011757 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100020001011985 and 100020001012003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100020001912013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50010000506006 + 50010000506007.
It is an arithmetic number, because the mean of its divisors is an integer number (50010000506007).
Almost surely, 2100020001012013 is an apocalyptic number.
It is an amenable number.
100020001012013 is a deficient number, since it is larger than the sum of its proper divisors (1).
100020001012013 is an equidigital number, since it uses as much as digits as its factorization.
100020001012013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 100020001012013 its reverse (310210100020001), we get a palindrome (410230101032014).
The spelling of 100020001012013 in words is "one hundred trillion, twenty billion, one million, twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •