Base | Representation |
---|---|
bin | 1011000000111001010011… |
… | …0110011010110101110111 |
3 | 1120212201001102111021021202 |
4 | 2300032110312122311313 |
5 | 3041402300041213421 |
6 | 41431132320203115 |
7 | 2356630224313166 |
oct | 260162466326567 |
9 | 46781042437252 |
10 | 12110010101111 |
11 | 394990aaa403a |
12 | 1437001a6949b |
13 | 69ac7a015380 |
14 | 2dc1b02713dd |
15 | 160020d6110b |
hex | b0394d9ad77 |
12110010101111 has 8 divisors (see below), whose sum is σ = 13109122136880. Its totient is φ = 11120551322112.
The previous prime is 12110010101089. The next prime is 12110010101113. The reversal of 12110010101111 is 11110101001121.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12110010101111 - 210 = 12110010100087 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12110010101092 and 12110010101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12110010101113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2413311581 + ... + 2413316598.
It is an arithmetic number, because the mean of its divisors is an integer number (1638640267110).
Almost surely, 212110010101111 is an apocalyptic number.
12110010101111 is a deficient number, since it is larger than the sum of its proper divisors (999112035769).
12110010101111 is a wasteful number, since it uses less digits than its factorization.
12110010101111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4826628385.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 12110010101111 its reverse (11110101001121), we get a palindrome (23220111102232).
The spelling of 12110010101111 in words is "twelve trillion, one hundred ten billion, ten million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •