Base | Representation |
---|---|
bin | 111000110100001101… |
… | …1000100110001101000 |
3 | 102122221011020121121210 |
4 | 1301220123010301220 |
5 | 3444334304342300 |
6 | 132015011233120 |
7 | 11546355330510 |
oct | 1615033046150 |
9 | 378834217553 |
10 | 122011012200 |
11 | 47821043380 |
12 | 1b7912a87a0 |
13 | b675a18c0c |
14 | 5c9646a840 |
15 | 32917e1050 |
hex | 1c686c4c68 |
122011012200 has 384 divisors, whose sum is σ = 482539115520. Its totient is φ = 24762931200.
The previous prime is 122011012187. The next prime is 122011012289. The reversal of 122011012200 is 2210110221.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1955892 + ... + 2017308.
It is an arithmetic number, because the mean of its divisors is an integer number (1256612280).
Almost surely, 2122011012200 is an apocalyptic number.
122011012200 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 122011012200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (241269557760).
122011012200 is an abundant number, since it is smaller than the sum of its proper divisors (360528103320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122011012200 is a wasteful number, since it uses less digits than its factorization.
122011012200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61497 (or 61488 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 122011012200 its reverse (2210110221), we get a palindrome (124221122421).
The spelling of 122011012200 in words is "one hundred twenty-two billion, eleven million, twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •