Base | Representation |
---|---|
bin | 1001000110101010010101… |
… | …11101001100001010000101 |
3 | 2121212220101012101110101212 |
4 | 10203111022331030022011 |
5 | 10111002131112334341 |
6 | 110325035041301205 |
7 | 4134255513154244 |
oct | 443251275141205 |
9 | 77786335343355 |
10 | 20020100121221 |
11 | 6419527660672 |
12 | 22b4043034805 |
13 | b22b6c6453a5 |
14 | 4d2d9996695b |
15 | 24ab7e7cc5eb |
hex | 12354af4c285 |
20020100121221 has 2 divisors, whose sum is σ = 20020100121222. Its totient is φ = 20020100121220.
The previous prime is 20020100121163. The next prime is 20020100121233. The reversal of 20020100121221 is 12212100102002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11757286632100 + 8262813489121 = 3428890^2 + 2874511^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020100121221 - 222 = 20020095926917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20020100121196 and 20020100121205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20020100121251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010050060610 + 10010050060611.
It is an arithmetic number, because the mean of its divisors is an integer number (10010050060611).
Almost surely, 220020100121221 is an apocalyptic number.
It is an amenable number.
20020100121221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020100121221 is an equidigital number, since it uses as much as digits as its factorization.
20020100121221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20020100121221 its reverse (12212100102002), we get a palindrome (32232200223223).
The spelling of 20020100121221 in words is "twenty trillion, twenty billion, one hundred million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •