Base | Representation |
---|---|
bin | 110010000001101110101000… |
… | …110100110110101100100000 |
3 | 1001212000210222022001102022011 |
4 | 302001232220310312230200 |
5 | 212314311224224200000 |
6 | 2055540150315322304 |
7 | 64226000341253044 |
oct | 6201565064665440 |
9 | 1055023868042264 |
10 | 220021122100000 |
11 | 64118485539781 |
12 | 20815698750394 |
13 | 959cb97568430 |
14 | 3c491171ba024 |
15 | 1a683c34402ba |
hex | c81ba8d36b20 |
220021122100000 has 144 divisors (see below), whose sum is σ = 583071547735656. Its totient is φ = 81238567680000.
The previous prime is 220021122099979. The next prime is 220021122100019. The reversal of 220021122100000 is 1221120022.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 203998490102416 + 16022631997584 = 14282804^2 + 4002828^2 .
It is a Harshad number since it is a multiple of its sum of digits (13).
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, 83323509 + ... + 85923508.
Almost surely, 2220021122100000 is an apocalyptic number.
220021122100000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220021122100000 is an abundant number, since it is smaller than the sum of its proper divisors (363050425635656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220021122100000 is an equidigital number, since it uses as much as digits as its factorization.
220021122100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169247065 (or 169247037 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 220021122100000 its reverse (1221120022), we get a palindrome (220022343220022).
The spelling of 220021122100000 in words is "two hundred twenty trillion, twenty-one billion, one hundred twenty-two million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •