Base | Representation |
---|---|
bin | 101111100000011101… |
… | …1101010000100110101 |
3 | 100202100000201110212001 |
4 | 1133000323222010311 |
5 | 3132414401041432 |
6 | 114511242255301 |
7 | 10241115100441 |
oct | 1370073520465 |
9 | 322300643761 |
10 | 102021112117 |
11 | 3a2a32925a1 |
12 | 179327b7531 |
13 | 980b469482 |
14 | 4d1b653821 |
15 | 29c18bc9e7 |
hex | 17c0eea135 |
102021112117 has 2 divisors, whose sum is σ = 102021112118. Its totient is φ = 102021112116.
The previous prime is 102021112057. The next prime is 102021112133. The reversal of 102021112117 is 711211120201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101522527876 + 498584241 = 318626^2 + 22329^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102021112117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102021112094 and 102021112103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102021112177) 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, 51010556058 + 51010556059.
It is an arithmetic number, because the mean of its divisors is an integer number (51010556059).
Almost surely, 2102021112117 is an apocalyptic number.
It is an amenable number.
102021112117 is a deficient number, since it is larger than the sum of its proper divisors (1).
102021112117 is an equidigital number, since it uses as much as digits as its factorization.
102021112117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 102021112117 its reverse (711211120201), we get a palindrome (813232232318).
The spelling of 102021112117 in words is "one hundred two billion, twenty-one million, one hundred twelve thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •