Base | Representation |
---|---|
bin | 11011110001000111000100… |
… | …011100110011001000111001 |
3 | 121000101202111012012220200020 |
4 | 123301013010130303020321 |
5 | 112001322030324323001 |
6 | 1111422041350201053 |
7 | 34503013336152150 |
oct | 3361070434631071 |
9 | 530352435186606 |
10 | 122122101011001 |
11 | 35a03768338843 |
12 | 118440b8653189 |
13 | 531b0ac22b480 |
14 | 2222a53cd6597 |
15 | e1ba21ca0736 |
hex | 6f11c4733239 |
122122101011001 has 128 divisors (see below), whose sum is σ = 212418532085760. Its totient is φ = 60602934067200.
The previous prime is 122122101010993. The next prime is 122122101011011. The reversal of 122122101011001 is 100110101221221.
It is a happy number.
It is not a de Polignac number, because 122122101011001 - 23 = 122122101010993 is a prime.
It is a super-2 number, since 2×1221221010110012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122122101011011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 571516141 + ... + 571729781.
It is an arithmetic number, because the mean of its divisors is an integer number (1659519781920).
Almost surely, 2122122101011001 is an apocalyptic number.
It is an amenable number.
122122101011001 is a deficient number, since it is larger than the sum of its proper divisors (90296431074759).
122122101011001 is a wasteful number, since it uses less digits than its factorization.
122122101011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214447.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122122101011001 its reverse (100110101221221), we get a palindrome (222232202232222).
The spelling of 122122101011001 in words is "one hundred twenty-two trillion, one hundred twenty-two billion, one hundred one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •