Base | Representation |
---|---|
bin | 10001110000011010111… |
… | …010010011000101011000 |
3 | 11022122121101100102100022 |
4 | 101300122322103011120 |
5 | 124443003340432300 |
6 | 2332321244330012 |
7 | 154105146404531 |
oct | 21603272230530 |
9 | 4278541312308 |
10 | 1220222202200 |
11 | 4305476929a1 |
12 | 1785a1b43908 |
13 | 8b0b3021521 |
14 | 430b8131688 |
15 | 21b1a1e9285 |
hex | 11c1ae93158 |
1220222202200 has 96 divisors (see below), whose sum is σ = 3046209003360. Its totient is φ = 452907571200.
The previous prime is 1220222202193. The next prime is 1220222202203. The reversal of 1220222202200 is 22022220221.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220222202203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2285987 + ... + 2768786.
It is an arithmetic number, because the mean of its divisors is an integer number (31731343785).
Almost surely, 21220222202200 is an apocalyptic number.
1220222202200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1220222202200 is an abundant number, since it is smaller than the sum of its proper divisors (1825986801160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220222202200 is a wasteful number, since it uses less digits than its factorization.
1220222202200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5054877 (or 5054868 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 17.
Adding to 1220222202200 its reverse (22022220221), we get a palindrome (1242244422421).
The spelling of 1220222202200 in words is "one trillion, two hundred twenty billion, two hundred twenty-two million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •