Base | Representation |
---|---|
bin | 1011000000111001101000… |
… | …1101110100011000010111 |
3 | 1120212201021200212202111211 |
4 | 2300032122031310120113 |
5 | 3041402441112333421 |
6 | 41431145253442251 |
7 | 2356632366421156 |
oct | 260163215643027 |
9 | 46781250782454 |
10 | 12110100121111 |
11 | 3949956899433 |
12 | 1437028040387 |
13 | 69ac92873445 |
14 | 2dc1bc1c559d |
15 | 160028be39e1 |
hex | b039a374617 |
12110100121111 has 8 divisors (see below), whose sum is σ = 12213263613600. Its totient is φ = 12007228464288.
The previous prime is 12110100121109. The next prime is 12110100121139. The reversal of 12110100121111 is 11112100101121.
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 12110100121111 - 21 = 12110100121109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12110100121091 and 12110100121100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12110100151111) 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, 72875571 + ... + 73041556.
It is an arithmetic number, because the mean of its divisors is an integer number (1526657951700).
Almost surely, 212110100121111 is an apocalyptic number.
12110100121111 is a deficient number, since it is larger than the sum of its proper divisors (103163492489).
12110100121111 is a wasteful number, since it uses less digits than its factorization.
12110100121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145917833.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 12110100121111 its reverse (11112100101121), we get a palindrome (23222200222232).
The spelling of 12110100121111 in words is "twelve trillion, one hundred ten billion, one hundred million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •