Base | Representation |
---|---|
bin | 10001011111101000101… |
… | …101011011110101111100 |
3 | 11020221002101120210002210 |
4 | 101133220231123311330 |
5 | 124144101211201340 |
6 | 2320141052220420 |
7 | 152566432150260 |
oct | 21375055336574 |
9 | 4227071523083 |
10 | 1202200100220 |
11 | 423939684a39 |
12 | 174bb246a710 |
13 | 894a0352b62 |
14 | 422887d00a0 |
15 | 21412e27180 |
hex | 117e8b5bd7c |
1202200100220 has 96 divisors (see below), whose sum is σ = 3881085078528. Its totient is φ = 272356826112.
The previous prime is 1202200100209. The next prime is 1202200100243. The reversal of 1202200100220 is 220010022021.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1202200100196 and 1202200100205.
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, 12617944 + ... + 12712863.
It is an arithmetic number, because the mean of its divisors is an integer number (40427969568).
Almost surely, 21202200100220 is an apocalyptic number.
1202200100220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1202200100220 is an abundant number, since it is smaller than the sum of its proper divisors (2678884978308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1202200100220 is a wasteful number, since it uses less digits than its factorization.
1202200100220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25330939 (or 25330937 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 1202200100220 its reverse (220010022021), we get a palindrome (1422210122241).
The spelling of 1202200100220 in words is "one trillion, two hundred two billion, two hundred million, one hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •