Base | Representation |
---|---|
bin | 101111100000110000… |
… | …1110101011010010101 |
3 | 100202100201112221010011 |
4 | 1133001201311122111 |
5 | 3132424431320041 |
6 | 114512241000221 |
7 | 10241266132135 |
oct | 1370141653225 |
9 | 322321487104 |
10 | 102031120021 |
11 | 3a2a89a8696 |
12 | 17936023071 |
13 | 98105617cc |
14 | 4d1cadaac5 |
15 | 29c26e7e81 |
hex | 17c1875695 |
102031120021 has 2 divisors, whose sum is σ = 102031120022. Its totient is φ = 102031120020.
The previous prime is 102031119991. The next prime is 102031120027. The reversal of 102031120021 is 120021130201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75985679025 + 26045440996 = 275655^2 + 161386^2 .
It is a cyclic number.
It is not a de Polignac number, because 102031120021 - 27 = 102031119893 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102031119983 and 102031120010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102031120027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51015560010 + 51015560011.
It is an arithmetic number, because the mean of its divisors is an integer number (51015560011).
Almost surely, 2102031120021 is an apocalyptic number.
It is an amenable number.
102031120021 is a deficient number, since it is larger than the sum of its proper divisors (1).
102031120021 is an equidigital number, since it uses as much as digits as its factorization.
102031120021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 102031120021 its reverse (120021130201), we get a palindrome (222052250222).
The spelling of 102031120021 in words is "one hundred two billion, thirty-one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •