Base | Representation |
---|---|
bin | 1011000001100010101100… |
… | …0011010100100001101111 |
3 | 1120220202201200201121121111 |
4 | 2300120223003110201233 |
5 | 3042043023210000421 |
6 | 41440210552012451 |
7 | 2360502440020243 |
oct | 260305303244157 |
9 | 46822650647544 |
10 | 12121120000111 |
11 | 39535a1274651 |
12 | 14391a2691127 |
13 | 69c02a93b0c5 |
14 | 2dc94598c423 |
15 | 1604713acee1 |
hex | b062b0d486f |
12121120000111 has 4 divisors (see below), whose sum is σ = 12121223124592. Its totient is φ = 12121016875632.
The previous prime is 12121120000109. The next prime is 12121120000139. The reversal of 12121120000111 is 11100002112121.
It is a happy number.
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 12121120000111 - 21 = 12121120000109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12121120000091 and 12121120000100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12121120000141) 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, 51385731 + ... + 51621076.
It is an arithmetic number, because the mean of its divisors is an integer number (3030305781148).
Almost surely, 212121120000111 is an apocalyptic number.
12121120000111 is a deficient number, since it is larger than the sum of its proper divisors (103124481).
12121120000111 is a wasteful number, since it uses less digits than its factorization.
12121120000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103124480.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12121120000111 its reverse (11100002112121), we get a palindrome (23221122112232).
The spelling of 12121120000111 in words is "twelve trillion, one hundred twenty-one billion, one hundred twenty million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •