Base | Representation |
---|---|
bin | 1011000001000100110100… |
… | …0101101011101101011111 |
3 | 1120220000000211202210111120 |
4 | 2300101031011223231133 |
5 | 3041430112341010421 |
6 | 41432403135222023 |
7 | 2360066636413221 |
oct | 260211505535537 |
9 | 46800024683446 |
10 | 12113101110111 |
11 | 3950156874931 |
12 | 1437725077913 |
13 | 69b350512b91 |
14 | 2dc3c49a8411 |
15 | 1601523d08c6 |
hex | b044d16bb5f |
12113101110111 has 8 divisors (see below), whose sum is σ = 16170716158464. Its totient is φ = 8065443400920.
The previous prime is 12113101110101. The next prime is 12113101110113. The reversal of 12113101110111 is 11101110131121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12113101110111 - 25 = 12113101110079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12113101110113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2489331951 + ... + 2489336816.
It is an arithmetic number, because the mean of its divisors is an integer number (2021339519808).
Almost surely, 212113101110111 is an apocalyptic number.
12113101110111 is a deficient number, since it is larger than the sum of its proper divisors (4057615048353).
12113101110111 is an equidigital number, since it uses as much as digits as its factorization.
12113101110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4978669581.
The product of its (nonzero) digits is 6, while the sum is 15.
Adding to 12113101110111 its reverse (11101110131121), we get a palindrome (23214211241232).
The spelling of 12113101110111 in words is "twelve trillion, one hundred thirteen billion, one hundred one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •