Base | Representation |
---|---|
bin | 10111001100010011000101… |
… | …101101001011100111010011 |
3 | 111101011010100100001201120202 |
4 | 113030103011231023213103 |
5 | 101332132402234113021 |
6 | 1000534124540525415 |
7 | 30325162023160265 |
oct | 2714230555134723 |
9 | 441133310051522 |
10 | 102000200301011 |
11 | 2a556050a26091 |
12 | b5343a485086b |
13 | 44bb76803b60c |
14 | 1b28b9c121b35 |
15 | bbd3d5165a0b |
hex | 5cc4c5b4b9d3 |
102000200301011 has 2 divisors, whose sum is σ = 102000200301012. Its totient is φ = 102000200301010.
The previous prime is 102000200301001. The next prime is 102000200301031. The reversal of 102000200301011 is 110103002000201.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 102000200301011 - 234 = 101983020431827 is a prime.
It is a super-2 number, since 2×1020002003010112 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102000200300983 and 102000200301001.
It is not a weakly prime, because it can be changed into another prime (102000200301001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51000100150505 + 51000100150506.
It is an arithmetic number, because the mean of its divisors is an integer number (51000100150506).
Almost surely, 2102000200301011 is an apocalyptic number.
102000200301011 is a deficient number, since it is larger than the sum of its proper divisors (1).
102000200301011 is an equidigital number, since it uses as much as digits as its factorization.
102000200301011 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 102000200301011 its reverse (110103002000201), we get a palindrome (212103202301212).
The spelling of 102000200301011 in words is "one hundred two trillion, two hundred million, three hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •