Base | Representation |
---|---|
bin | 11011010011110110000110… |
… | …001101110100011011011000 |
3 | 120202021111111221211012200220 |
4 | 123103312012031310123120 |
5 | 111220344323110432300 |
6 | 1103242123125400040 |
7 | 34204506565266345 |
oct | 3323660615643330 |
9 | 522244457735626 |
10 | 120111012202200 |
11 | 352a8881111868 |
12 | 1157a39ab69020 |
13 | 520355c546a96 |
14 | 21935928597cc |
15 | dd456a53eda0 |
hex | 6d3d863746d8 |
120111012202200 has 96 divisors (see below), whose sum is σ = 372371166459600. Its totient is φ = 32027278210560.
The previous prime is 120111012202193. The next prime is 120111012202231. The reversal of 120111012202200 is 2202210111021.
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 120111012202200.
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, 1014534 + ... + 15532266.
Almost surely, 2120111012202200 is an apocalyptic number.
120111012202200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
120111012202200 is an abundant number, since it is smaller than the sum of its proper divisors (252260154257400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
120111012202200 is a wasteful number, since it uses less digits than its factorization.
120111012202200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14531541 (or 14531532 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 120111012202200 its reverse (2202210111021), we get a palindrome (122313222313221).
The spelling of 120111012202200 in words is "one hundred twenty trillion, one hundred eleven billion, twelve million, two hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •