Base | Representation |
---|---|
bin | 1011000000010111110001… |
… | …1110010111111101111111 |
3 | 1120211211211021111020112111 |
4 | 2300011330132113331333 |
5 | 3041230332332210421 |
6 | 41423043334514451 |
7 | 2356161224101315 |
oct | 260057436277577 |
9 | 46754737436474 |
10 | 12101011210111 |
11 | 39460123a003a |
12 | 1435310205a27 |
13 | 69a174862ab5 |
14 | 2db9990680b5 |
15 | 15eb95d02ee1 |
hex | b017c797f7f |
12101011210111 has 8 divisors (see below), whose sum is σ = 12178233005904. Its totient is φ = 12023791253760.
The previous prime is 12101011210109. The next prime is 12101011210177. The reversal of 12101011210111 is 11101211010121.
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 12101011210111 - 21 = 12101011210109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12101011210091 and 12101011210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12101011210711) 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, 14231976 + ... + 15058258.
It is an arithmetic number, because the mean of its divisors is an integer number (1522279125738).
Almost surely, 212101011210111 is an apocalyptic number.
12101011210111 is a deficient number, since it is larger than the sum of its proper divisors (77221795793).
12101011210111 is an equidigital number, since it uses as much as digits as its factorization.
12101011210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 919721.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 12101011210111 its reverse (11101211010121), we get a palindrome (23202222220232).
The spelling of 12101011210111 in words is "twelve trillion, one hundred one billion, eleven million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •