Base | Representation |
---|---|
bin | 110010000100011110101001… |
… | …100000111101001100110000 |
3 | 1001212200212210100022100111022 |
4 | 302010132221200331030300 |
5 | 212330410302212101000 |
6 | 2100203043505435012 |
7 | 64245440602633265 |
oct | 6204365140751460 |
9 | 1055625710270438 |
10 | 220210112222000 |
11 | 6419064753564a |
12 | 2084624103ba68 |
13 | 95b49558b1aa4 |
14 | 3c54324d7926c |
15 | 1a6d285023585 |
hex | c847a983d330 |
220210112222000 has 40 divisors (see below), whose sum is σ = 532468051357632. Its totient is φ = 88084044888000.
The previous prime is 220210112221997. The next prime is 220210112222063. The reversal of 220210112222000 is 222211012022.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 220210112222000.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55052526056 + ... + 55052530055.
Almost surely, 2220210112222000 is an apocalyptic number.
220210112222000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220210112222000 is an abundant number, since it is smaller than the sum of its proper divisors (312257939135632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220210112222000 is a wasteful number, since it uses less digits than its factorization.
220210112222000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110105056134 (or 110105056118 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 220210112222000 its reverse (222211012022), we get a palindrome (220432323234022).
The spelling of 220210112222000 in words is "two hundred twenty trillion, two hundred ten billion, one hundred twelve million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •