Base | Representation |
---|---|
bin | 1001000110101100011011… |
… | …10101101000000110100010 |
3 | 2121220000021101210120120200 |
4 | 10203112031311220012202 |
5 | 10111011430341241002 |
6 | 110325342243450030 |
7 | 4134325356605034 |
oct | 443261565500642 |
9 | 77800241716520 |
10 | 20021222212002 |
11 | 6419a52a94020 |
12 | 22b42b6986916 |
13 | b22cbac5c02b |
14 | 4d30649b5c54 |
15 | 24abe8078b1c |
hex | 12358dd681a2 |
20021222212002 has 48 divisors (see below), whose sum is σ = 47415861380160. Its totient is φ = 6055117480800.
The previous prime is 20021222211989. The next prime is 20021222212021.
20021222212002 is a `hidden beast` number, since 200 + 21 + 22 + 221 + 200 + 2 = 666.
20021222212002 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 99228574 + ... + 99430137.
It is an arithmetic number, because the mean of its divisors is an integer number (987830445420).
Almost surely, 220021222212002 is an apocalyptic number.
20021222212002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20021222212002 is an abundant number, since it is smaller than the sum of its proper divisors (27394639168158).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20021222212002 is a wasteful number, since it uses less digits than its factorization.
20021222212002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198659239 (or 198659236 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 18.
It can be divided in two parts, 2002122 and 2212002, that added together give a palindrome (4214124).
The spelling of 20021222212002 in words is "twenty trillion, twenty-one billion, two hundred twenty-two million, two hundred twelve thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •