Base | Representation |
---|---|
bin | 101111000100111111… |
… | …0111000010100101011 |
3 | 100122221202222222221012 |
4 | 1132021332320110223 |
5 | 3124022344210102 |
6 | 114235550534135 |
7 | 10206222051314 |
oct | 1361176702453 |
9 | 318852888835 |
10 | 101099210027 |
11 | 3996a960942 |
12 | 17715b0734b |
13 | 96c247498a |
14 | 4c7103560b |
15 | 296a9b6752 |
hex | 1789fb852b |
101099210027 has 2 divisors, whose sum is σ = 101099210028. Its totient is φ = 101099210026.
The previous prime is 101099209999. The next prime is 101099210029. The reversal of 101099210027 is 720012990101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101099210027 - 216 = 101099144491 is a prime.
Together with 101099210029, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 101099209975 and 101099210002.
It is not a weakly prime, because it can be changed into another prime (101099210029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50549605013 + 50549605014.
It is an arithmetic number, because the mean of its divisors is an integer number (50549605014).
Almost surely, 2101099210027 is an apocalyptic number.
101099210027 is a deficient number, since it is larger than the sum of its proper divisors (1).
101099210027 is an equidigital number, since it uses as much as digits as its factorization.
101099210027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 32.
The spelling of 101099210027 in words is "one hundred one billion, ninety-nine million, two hundred ten thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •