Base | Representation |
---|---|
bin | 11011110000111101101010… |
… | …111111011100101011011011 |
3 | 121000100210102221121010000020 |
4 | 123300331222333130223123 |
5 | 112001140344103210021 |
6 | 1111413252201241523 |
7 | 34502205306600243 |
oct | 3360755277345333 |
9 | 530323387533006 |
10 | 122112010210011 |
11 | 359aa45a345698 |
12 | 118421611932a3 |
13 | 531a16179b603 |
14 | 2222377a98b23 |
15 | e1b630e587c6 |
hex | 6f0f6afdcadb |
122112010210011 has 16 divisors (see below), whose sum is σ = 171191512342560. Its totient is φ = 77312295889920.
The previous prime is 122112010209983. The next prime is 122112010210031. The reversal of 122112010210011 is 110012010211221.
It is a happy number.
It is not a de Polignac number, because 122112010210011 - 214 = 122112010193627 is a prime.
It is a super-2 number, since 2×1221120102100112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122112010210031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11504800630 + ... + 11504811243.
It is an arithmetic number, because the mean of its divisors is an integer number (10699469521410).
Almost surely, 2122112010210011 is an apocalyptic number.
122112010210011 is a deficient number, since it is larger than the sum of its proper divisors (49079502132549).
122112010210011 is a wasteful number, since it uses less digits than its factorization.
122112010210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23009611966.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122112010210011 its reverse (110012010211221), we get a palindrome (232124020421232).
The spelling of 122112010210011 in words is "one hundred twenty-two trillion, one hundred twelve billion, ten million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •