Base | Representation |
---|---|
bin | 101111110001010110111101… |
… | …111100101001110010000001 |
3 | 1000112220101002100110101211221 |
4 | 233301112331330221302001 |
5 | 210014240002103341113 |
6 | 2022502353204035041 |
7 | 62153142250022602 |
oct | 5761267574516201 |
9 | 1015811070411757 |
10 | 210100102012033 |
11 | 60a42a53318632 |
12 | 1b692983092a81 |
13 | 903047c0c338c |
14 | 39c4c83569da9 |
15 | 19452bc16c98d |
hex | bf15bdf29c81 |
210100102012033 has 2 divisors, whose sum is σ = 210100102012034. Its totient is φ = 210100102012032.
The previous prime is 210100102011907. The next prime is 210100102012039. The reversal of 210100102012033 is 330210201001012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 196978081172544 + 13122020839489 = 14034888^2 + 3622433^2 .
It is a cyclic number.
It is not a de Polignac number, because 210100102012033 - 29 = 210100102011521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210100102011998 and 210100102012016.
It is not a weakly prime, because it can be changed into another prime (210100102012039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105050051006016 + 105050051006017.
It is an arithmetic number, because the mean of its divisors is an integer number (105050051006017).
Almost surely, 2210100102012033 is an apocalyptic number.
It is an amenable number.
210100102012033 is a deficient number, since it is larger than the sum of its proper divisors (1).
210100102012033 is an equidigital number, since it uses as much as digits as its factorization.
210100102012033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 210100102012033 its reverse (330210201001012), we get a palindrome (540310303013045).
The spelling of 210100102012033 in words is "two hundred ten trillion, one hundred billion, one hundred two million, twelve thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •