Base | Representation |
---|---|
bin | 1001101001101001000100… |
… | …11000010001111111001100 |
3 | 2210010210201101020121220020 |
4 | 10310310202120101333030 |
5 | 10240200134102400022 |
6 | 113045131253422140 |
7 | 4320145124235156 |
oct | 464644230217714 |
9 | 83123641217806 |
10 | 21222010200012 |
11 | 6842227557176 |
12 | 2468b7433a950 |
13 | bac2c488231b |
14 | 535217a1dad6 |
15 | 26c07701735c |
hex | 134d22611fcc |
21222010200012 has 12 divisors (see below), whose sum is σ = 49518023800056. Its totient is φ = 7074003400000.
The previous prime is 21222010200011. The next prime is 21222010200059. The reversal of 21222010200012 is 21000201022212.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 21222010199964 and 21222010200000.
It is not an unprimeable number, because it can be changed into a prime (21222010200011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 884250424989 + ... + 884250425012.
It is an arithmetic number, because the mean of its divisors is an integer number (4126501983338).
Almost surely, 221222010200012 is an apocalyptic number.
It is an amenable number.
21222010200012 is an abundant number, since it is smaller than the sum of its proper divisors (28296013600044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21222010200012 is a wasteful number, since it uses less digits than its factorization.
21222010200012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1768500850008 (or 1768500850006 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 21222010200012 its reverse (21000201022212), we get a palindrome (42222211222224).
The spelling of 21222010200012 in words is "twenty-one trillion, two hundred twenty-two billion, ten million, two hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •