Base | Representation |
---|---|
bin | 1001010010000101111001… |
… | …0101111101110111001011 |
3 | 1100010201120022111110001022 |
4 | 2110201132111331313023 |
5 | 2314210224312041021 |
6 | 33412433355343055 |
7 | 2102250505011302 |
oct | 224413625756713 |
9 | 40121508443038 |
10 | 10206425112011 |
11 | 328557a992a47 |
12 | 118a0a7151a8b |
13 | 590600637c0b |
14 | 273dca67d439 |
15 | 12a75c4c41ab |
hex | 9485e57ddcb |
10206425112011 has 2 divisors, whose sum is σ = 10206425112012. Its totient is φ = 10206425112010.
The previous prime is 10206425111963. The next prime is 10206425112017. The reversal of 10206425112011 is 11021152460201.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10206425112011 - 218 = 10206424849867 is a prime.
It is a super-2 number, since 2×102064251120112 (a number of 27 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (10206425112017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5103212556005 + 5103212556006.
It is an arithmetic number, because the mean of its divisors is an integer number (5103212556006).
Almost surely, 210206425112011 is an apocalyptic number.
10206425112011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10206425112011 is an equidigital number, since it uses as much as digits as its factorization.
10206425112011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 960, while the sum is 26.
Adding to 10206425112011 its reverse (11021152460201), we get a palindrome (21227577572212).
The spelling of 10206425112011 in words is "ten trillion, two hundred six billion, four hundred twenty-five million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •