Base | Representation |
---|---|
bin | 10001110000001110010… |
… | …000111000110010110101 |
3 | 11022122001121002110010002 |
4 | 101300032100320302311 |
5 | 124442040031120041 |
6 | 2332244224441045 |
7 | 154066662031562 |
oct | 21601620706265 |
9 | 4278047073102 |
10 | 1220010020021 |
11 | 43044893a321 |
12 | 178542a79185 |
13 | 8b07b090340 |
14 | 43097c9b869 |
15 | 21b0678559b |
hex | 11c0e438cb5 |
1220010020021 has 16 divisors (see below), whose sum is σ = 1344537961536. Its totient is φ = 1099869998976.
The previous prime is 1220010020003. The next prime is 1220010020023. The reversal of 1220010020021 is 1200200100221.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1220010020021 - 218 = 1220009757877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1220010019984 and 1220010020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220010020023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6204806 + ... + 6398408.
It is an arithmetic number, because the mean of its divisors is an integer number (84033622596).
Almost surely, 21220010020021 is an apocalyptic number.
It is an amenable number.
1220010020021 is a deficient number, since it is larger than the sum of its proper divisors (124527941515).
1220010020021 is a wasteful number, since it uses less digits than its factorization.
1220010020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 204932.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 1220010020021 its reverse (1200200100221), we get a palindrome (2420210120242).
It can be divided in two parts, 12200100200 and 21, that added together give a palindrome (12200100221).
The spelling of 1220010020021 in words is "one trillion, two hundred twenty billion, ten million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •