Base | Representation |
---|---|
bin | 11011110000111101110110… |
… | …010011011100100111011011 |
3 | 121000100210221011201112200120 |
4 | 123300331312103130213123 |
5 | 112001141241200031021 |
6 | 1111413323101204323 |
7 | 34502213103030552 |
oct | 3360756623344733 |
9 | 530323834645616 |
10 | 122112200002011 |
11 | 359aa54749618a |
12 | 118421b48606a3 |
13 | 531a191bc047b |
14 | 2222394d80d99 |
15 | e1b6429482c6 |
hex | 6f0f764dc9db |
122112200002011 has 16 divisors (see below), whose sum is σ = 163858561679520. Its totient is φ = 80888627240960.
The previous prime is 122112200002007. The next prime is 122112200002031. The reversal of 122112200002011 is 110200002211221.
It is a cyclic number.
It is not a de Polignac number, because 122112200002011 - 22 = 122112200002007 is a prime.
It is a super-2 number, since 2×1221122000020112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122112200002031) 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 15 ways as a sum of consecutive naturals, for example, 204878526 + ... + 205473683.
It is an arithmetic number, because the mean of its divisors is an integer number (10241160104970).
Almost surely, 2122112200002011 is an apocalyptic number.
122112200002011 is a deficient number, since it is larger than the sum of its proper divisors (41746361677509).
122112200002011 is a wasteful number, since it uses less digits than its factorization.
122112200002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410352846.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122112200002011 its reverse (110200002211221), we get a palindrome (232312202213232).
The spelling of 122112200002011 in words is "one hundred twenty-two trillion, one hundred twelve billion, two hundred million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •