Base | Representation |
---|---|
bin | 10001110000001101101… |
… | …010101100111111011000 |
3 | 11022122000220020220012222 |
4 | 101300031222230333120 |
5 | 124442030000311300 |
6 | 2332243230123212 |
7 | 154066510661456 |
oct | 21601552547730 |
9 | 4278026226188 |
10 | 1220000010200 |
11 | 430443222844 |
12 | 17853b650508 |
13 | 8b078c9717a |
14 | 430968139d6 |
15 | 21b05959785 |
hex | 11c0daacfd8 |
1220000010200 has 96 divisors (see below), whose sum is σ = 2844326880000. Its totient is φ = 486655002240.
The previous prime is 1220000010161. The next prime is 1220000010239. The reversal of 1220000010200 is 20100000221.
It is an interprime number because it is at equal distance from previous prime (1220000010161) and next prime (1220000010239).
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
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, 160374797 + ... + 160382403.
It is an arithmetic number, because the mean of its divisors is an integer number (29628405000).
Almost surely, 21220000010200 is an apocalyptic number.
1220000010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1220000010200 is an abundant number, since it is smaller than the sum of its proper divisors (1624326869800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220000010200 is a wasteful number, since it uses less digits than its factorization.
1220000010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9729 (or 9720 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 1220000010200 its reverse (20100000221), we get a palindrome (1240100010421).
The spelling of 1220000010200 in words is "one trillion, two hundred twenty billion, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •