Base | Representation |
---|---|
bin | 111000110111001100… |
… | …1101011100010110000 |
3 | 102200012010222021100010 |
4 | 1301232121223202300 |
5 | 4000040443410000 |
6 | 132032553054520 |
7 | 11552014003101 |
oct | 1615631534260 |
9 | 380163867303 |
10 | 122111310000 |
11 | 47872718619 |
12 | 1b7ba9b7440 |
13 | b690735124 |
14 | 5ca58d83a8 |
15 | 329a503d50 |
hex | 1c6e66b8b0 |
122111310000 has 100 divisors (see below), whose sum is σ = 394191687032. Its totient is φ = 32563008000.
The previous prime is 122111309977. The next prime is 122111310011. The reversal of 122111310000 is 13111221.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×1221113100002 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 2005189 + ... + 2065188.
Almost surely, 2122111310000 is an apocalyptic number.
122111310000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122111310000 is an abundant number, since it is smaller than the sum of its proper divisors (272080377032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122111310000 is an equidigital number, since it uses as much as digits as its factorization.
122111310000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4070408 (or 4070387 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 122111310000 its reverse (13111221), we get a palindrome (122124421221).
The spelling of 122111310000 in words is "one hundred twenty-two billion, one hundred eleven million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •