Base | Representation |
---|---|
bin | 11011101111011111100110… |
… | …111010101001001010101010 |
3 | 121000000010202002002102121220 |
4 | 123233133212322221022222 |
5 | 111443012022042010442 |
6 | 1111255030110442510 |
7 | 34462001400113520 |
oct | 3357374672511252 |
9 | 530003662072556 |
10 | 122011010110122 |
11 | 35970640428761 |
12 | 11826674503436 |
13 | 5310786a183b3 |
14 | 221b515ca2310 |
15 | e18bbe01ceec |
hex | 6ef7e6ea92aa |
122011010110122 has 16 divisors (see below), whose sum is σ = 278882308823232. Its totient is φ = 34860288602880.
The previous prime is 122011010110057. The next prime is 122011010110127. The reversal of 122011010110122 is 221011010110221.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (122011010110127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1452512025079 + ... + 1452512025162.
It is an arithmetic number, because the mean of its divisors is an integer number (17430144301452).
Almost surely, 2122011010110122 is an apocalyptic number.
122011010110122 is an abundant number, since it is smaller than the sum of its proper divisors (156871298713110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122011010110122 is a wasteful number, since it uses less digits than its factorization.
122011010110122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2905024050253.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122011010110122 its reverse (221011010110221), we get a palindrome (343022020220343).
Subtracting 122011010110122 from its reverse (221011010110221), we obtain a palindrome (99000000000099).
The spelling of 122011010110122 in words is "one hundred twenty-two trillion, eleven billion, ten million, one hundred ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •