Base | Representation |
---|---|
bin | 1001001100100011001010… |
… | …0111000101010110100010 |
3 | 1022210121210001122022100222 |
4 | 2103020302213011112202 |
5 | 2311130220220333442 |
6 | 33301004440243042 |
7 | 2062340004646124 |
oct | 223106247052642 |
9 | 38717701568328 |
10 | 10111202121122 |
11 | 3249155aa9563 |
12 | 1173751170482 |
13 | 5846367101ab |
14 | 26d555c35214 |
15 | 1280378448d2 |
hex | 932329c55a2 |
10111202121122 has 8 divisors (see below), whose sum is σ = 15178301899200. Its totient is φ = 5051768154724.
The previous prime is 10111202121113. The next prime is 10111202121131. The reversal of 10111202121122 is 22112120211101.
It is an interprime number because it is at equal distance from previous prime (10111202121113) and next prime (10111202121131).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10111202121122.
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 3 ways as a sum of consecutive naturals, for example, 1916449622 + ... + 1916454897.
It is an arithmetic number, because the mean of its divisors is an integer number (1897287737400).
Almost surely, 210111202121122 is an apocalyptic number.
10111202121122 is a deficient number, since it is larger than the sum of its proper divisors (5067099778078).
10111202121122 is a wasteful number, since it uses less digits than its factorization.
10111202121122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3832905840.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 10111202121122 its reverse (22112120211101), we get a palindrome (32223322332223).
The spelling of 10111202121122 in words is "ten trillion, one hundred eleven billion, two hundred two million, one hundred twenty-one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •