Base | Representation |
---|---|
bin | 10001100111000101101… |
… | …010101110000000011100 |
3 | 11021200202001210111220220 |
4 | 101213011222232000130 |
5 | 124311443220321340 |
6 | 2323543103241340 |
7 | 153301636202532 |
oct | 21470552560034 |
9 | 4250661714826 |
10 | 1210202120220 |
11 | 427275602005 |
12 | 1766662a9250 |
13 | 8a177122532 |
14 | 42807462152 |
15 | 217306c0ed0 |
hex | 119c5aae01c |
1210202120220 has 96 divisors (see below), whose sum is σ = 3487713438720. Its totient is φ = 313411887360.
The previous prime is 1210202120219. The next prime is 1210202120243. The reversal of 1210202120220 is 220212020121.
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 1210202120220.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1803622 + ... + 2381901.
It is an arithmetic number, because the mean of its divisors is an integer number (36330348320).
Almost surely, 21210202120220 is an apocalyptic number.
1210202120220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1210202120220 is an abundant number, since it is smaller than the sum of its proper divisors (2277511318500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210202120220 is a wasteful number, since it uses less digits than its factorization.
1210202120220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4185675 (or 4185673 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1210202120220 its reverse (220212020121), we get a palindrome (1430414140341).
The spelling of 1210202120220 in words is "one trillion, two hundred ten billion, two hundred two million, one hundred twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •