Base | Representation |
---|---|
bin | 11011110000110011100111… |
… | …010100001001101011100001 |
3 | 121000022202120100011222220100 |
4 | 123300303213110021223201 |
5 | 112001001240021010423 |
6 | 1111404304431133013 |
7 | 34501343560011054 |
oct | 3360634724115341 |
9 | 530282510158810 |
10 | 122101211110113 |
11 | 359a5918555044 |
12 | 11840048674169 |
13 | 5319130384b81 |
14 | 2221a31762a9b |
15 | e1b1ecd50343 |
hex | 6f0ce7509ae1 |
122101211110113 has 24 divisors (see below), whose sum is σ = 176579842682880. Its totient is φ = 81303251400000.
The previous prime is 122101211110009. The next prime is 122101211110141. The reversal of 122101211110113 is 311011112101221.
122101211110113 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 122101211110113 - 230 = 122100137368289 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122101211110163) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 56569488 + ... + 58688238.
It is an arithmetic number, because the mean of its divisors is an integer number (7357493445120).
Almost surely, 2122101211110113 is an apocalyptic number.
It is an amenable number.
122101211110113 is a deficient number, since it is larger than the sum of its proper divisors (54478631572767).
122101211110113 is a wasteful number, since it uses less digits than its factorization.
122101211110113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2126429 (or 2126426 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 18.
Adding to 122101211110113 its reverse (311011112101221), we get a palindrome (433112323211334).
The spelling of 122101211110113 in words is "one hundred twenty-two trillion, one hundred one billion, two hundred eleven million, one hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •