Base | Representation |
---|---|
bin | 1001001100011110110111… |
… | …11100110001000100100010 |
3 | 2122121000121121201001201220 |
4 | 10212033123330301010202 |
5 | 10122241231401432320 |
6 | 111000553010435510 |
7 | 4154565646252650 |
oct | 446173374610442 |
9 | 78530547631656 |
10 | 20220101202210 |
11 | 6496329a9aa48 |
12 | 232695ab92b96 |
13 | b38993c525b0 |
14 | 4dc92dc49dd0 |
15 | 250e87db6e40 |
hex | 1263dbf31122 |
20220101202210 has 128 divisors (see below), whose sum is σ = 59728553902080. Its totient is φ = 4266113031936.
The previous prime is 20220101202199. The next prime is 20220101202233. The reversal of 20220101202210 is 1220210102202.
It is a super-3 number, since 3×202201012022103 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 20220101202210.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 161725501 + ... + 161850479.
It is an arithmetic number, because the mean of its divisors is an integer number (466629327360).
Almost surely, 220220101202210 is an apocalyptic number.
20220101202210 is an abundant number, since it is smaller than the sum of its proper divisors (39508452699870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20220101202210 is a wasteful number, since it uses less digits than its factorization.
20220101202210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184272.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 20220101202210 its reverse (1220210102202), we get a palindrome (21440311304412).
The spelling of 20220101202210 in words is "twenty trillion, two hundred twenty billion, one hundred one million, two hundred two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •