Base | Representation |
---|---|
bin | 11011110000111100111010… |
… | …110000100110000101011011 |
3 | 121000100201100112221111021212 |
4 | 123300330322300212011123 |
5 | 112001132214424310021 |
6 | 1111413040013253335 |
7 | 34502146252525463 |
oct | 3360747260460533 |
9 | 530321315844255 |
10 | 122111201010011 |
11 | 359aa0845a0764 |
12 | 11841b7619424b |
13 | 531a062c47045 |
14 | 22222dc416ba3 |
15 | e1b5d4db585b |
hex | 6f0f3ac2615b |
122111201010011 has 4 divisors (see below), whose sum is σ = 122259574280592. Its totient is φ = 121962827739432.
The previous prime is 122111201009999. The next prime is 122111201010047. The reversal of 122111201010011 is 110010102111221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 122111201010011 - 234 = 122094021140827 is a prime.
It is a super-2 number, since 2×1221112010100112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122111201010311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 74186634056 + ... + 74186635701.
It is an arithmetic number, because the mean of its divisors is an integer number (30564893570148).
Almost surely, 2122111201010011 is an apocalyptic number.
122111201010011 is a deficient number, since it is larger than the sum of its proper divisors (148373270581).
122111201010011 is an equidigital number, since it uses as much as digits as its factorization.
122111201010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148373270580.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 122111201010011 its reverse (110010102111221), we get a palindrome (232121303121232).
The spelling of 122111201010011 in words is "one hundred twenty-two trillion, one hundred eleven billion, two hundred one million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •