Base | Representation |
---|---|
bin | 111000110110111011… |
… | …0100101101111100000 |
3 | 102200011111122220221211 |
4 | 1301231312211233200 |
5 | 4000031120024300 |
6 | 132032023555504 |
7 | 11551542551326 |
oct | 1615566455740 |
9 | 380144586854 |
10 | 122102111200 |
11 | 47868505403 |
12 | 1b7b78bbb94 |
13 | b68b864154 |
14 | 5ca45c1d16 |
15 | 32997d84ba |
hex | 1c6dda5be0 |
122102111200 has 72 divisors (see below), whose sum is σ = 298293454872. Its totient is φ = 48806161920.
The previous prime is 122102111191. The next prime is 122102111249. The reversal of 122102111200 is 2111201221.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1088122 + ... + 1195078.
It is an arithmetic number, because the mean of its divisors is an integer number (4142964651).
Almost surely, 2122102111200 is an apocalyptic number.
122102111200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 122102111200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (149146727436).
122102111200 is an abundant number, since it is smaller than the sum of its proper divisors (176191343672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122102111200 is a wasteful number, since it uses less digits than its factorization.
122102111200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108404 (or 108391 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 122102111200 its reverse (2111201221), we get a palindrome (124213312421).
The spelling of 122102111200 in words is "one hundred twenty-two billion, one hundred two million, one hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •