Base | Representation |
---|---|
bin | 10111001101110000001110… |
… | …101111111100100000100011 |
3 | 111101111200111011222100021002 |
4 | 113031300032233330200203 |
5 | 101340302212230311042 |
6 | 1001052104452022215 |
7 | 30335332245524306 |
oct | 2715601657744043 |
9 | 441450434870232 |
10 | 102100210010147 |
11 | 2a594501892868 |
12 | b54b85590196b |
13 | 44c801586a3bb |
14 | 1b2d96858cb3d |
15 | bc0cda16c132 |
hex | 5cdc0ebfc823 |
102100210010147 has 2 divisors, whose sum is σ = 102100210010148. Its totient is φ = 102100210010146.
The previous prime is 102100210010089. The next prime is 102100210010179. The reversal of 102100210010147 is 741010012001201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102100210010147 - 212 = 102100210006051 is a prime.
It is a super-2 number, since 2×1021002100101472 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102100210090147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51050105005073 + 51050105005074.
It is an arithmetic number, because the mean of its divisors is an integer number (51050105005074).
Almost surely, 2102100210010147 is an apocalyptic number.
102100210010147 is a deficient number, since it is larger than the sum of its proper divisors (1).
102100210010147 is an equidigital number, since it uses as much as digits as its factorization.
102100210010147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 102100210010147 its reverse (741010012001201), we get a palindrome (843110222011348).
The spelling of 102100210010147 in words is "one hundred two trillion, one hundred billion, two hundred ten million, ten thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •