Base | Representation |
---|---|
bin | 10111001111011111111001… |
… | …011101101111101111100101 |
3 | 111101221010222100201121212221 |
4 | 113033133321131233233211 |
5 | 101344233242133031041 |
6 | 1001223134323512341 |
7 | 30350105444611606 |
oct | 2717377135575745 |
9 | 441833870647787 |
10 | 102220112002021 |
11 | 2a630340396a32 |
12 | b56ab388286b1 |
13 | 450641365a7a0 |
14 | 1b356a08a1dad |
15 | bc3ea67132d1 |
hex | 5cf7f976fbe5 |
102220112002021 has 64 divisors (see below), whose sum is σ = 115726036478976. Its totient is φ = 89678679552000.
The previous prime is 102220112002009. The next prime is 102220112002027. The reversal of 102220112002021 is 120200211022201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 102220112002021 - 245 = 67035739913189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102220112001986 and 102220112002004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102220112002027) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6637230921 + ... + 6637246321.
It is an arithmetic number, because the mean of its divisors is an integer number (1808219319984).
Almost surely, 2102220112002021 is an apocalyptic number.
It is an amenable number.
102220112002021 is a deficient number, since it is larger than the sum of its proper divisors (13505924476955).
102220112002021 is a wasteful number, since it uses less digits than its factorization.
102220112002021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17822.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102220112002021 its reverse (120200211022201), we get a palindrome (222420323024222).
The spelling of 102220112002021 in words is "one hundred two trillion, two hundred twenty billion, one hundred twelve million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •