Base | Representation |
---|---|
bin | 10110101111010101101010… |
… | …100111000001000000101011 |
3 | 111010002212112222012101021222 |
4 | 112233111222213001000223 |
5 | 101102031142114200021 |
6 | 552412001233452255 |
7 | 30031330363443665 |
oct | 2657255247010053 |
9 | 433085488171258 |
10 | 100010102100011 |
11 | 29959056417464 |
12 | b272764a1108b |
13 | 43a5bb2030a0c |
14 | 1a9a72c751535 |
15 | b8675b5e96ab |
hex | 5af56a9c102b |
100010102100011 has 2 divisors, whose sum is σ = 100010102100012. Its totient is φ = 100010102100010.
The previous prime is 100010102099927. The next prime is 100010102100043. The reversal of 100010102100011 is 110001201010001.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100010102100011 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (100010102100091) 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, 50005051050005 + 50005051050006.
It is an arithmetic number, because the mean of its divisors is an integer number (50005051050006).
Almost surely, 2100010102100011 is an apocalyptic number.
100010102100011 is a deficient number, since it is larger than the sum of its proper divisors (1).
100010102100011 is an equidigital number, since it uses as much as digits as its factorization.
100010102100011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100010102100011 its reverse (110001201010001), we get a palindrome (210011303110012).
The spelling of 100010102100011 in words is "one hundred trillion, ten billion, one hundred two million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •