Base | Representation |
---|---|
bin | 11011110000111101101010… |
… | …011100101100110011010101 |
3 | 121000100210102022110022210221 |
4 | 123300331222130230303111 |
5 | 112001140334240213023 |
6 | 1111413251234114341 |
7 | 34502205136301350 |
oct | 3360755234546325 |
9 | 530323368408727 |
10 | 122112001101013 |
11 | 359aa4551939a0 |
12 | 1184215a11b9b1 |
13 | 531a15c92c481 |
14 | 22223767a7297 |
15 | e1b63025985d |
hex | 6f0f6a72ccd5 |
122112001101013 has 32 divisors (see below), whose sum is σ = 152497000028160. Its totient is φ = 94993883645760.
The previous prime is 122112001101007. The next prime is 122112001101017. The reversal of 122112001101013 is 310101100211221.
It is a happy number.
It is not a de Polignac number, because 122112001101013 - 29 = 122112001100501 is a prime.
It is a super-2 number, since 2×1221120011010132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122112001101017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 160744408 + ... + 161502286.
It is an arithmetic number, because the mean of its divisors is an integer number (4765531250880).
Almost surely, 2122112001101013 is an apocalyptic number.
It is an amenable number.
122112001101013 is a deficient number, since it is larger than the sum of its proper divisors (30384998927147).
122112001101013 is a wasteful number, since it uses less digits than its factorization.
122112001101013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 761377.
The product of its (nonzero) digits is 24, while the sum is 16.
Adding to 122112001101013 its reverse (310101100211221), we get a palindrome (432213101312234).
The spelling of 122112001101013 in words is "one hundred twenty-two trillion, one hundred twelve billion, one million, one hundred one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •