Base | Representation |
---|---|
bin | 1011000001011110111011… |
… | …0110100011011000001111 |
3 | 1120220200010022021022111211 |
4 | 2300113232312203120033 |
5 | 3042033441131120421 |
6 | 41435522432355251 |
7 | 2360435424232162 |
oct | 260275666433017 |
9 | 46820108238454 |
10 | 12120110020111 |
11 | 3953123154735 |
12 | 1438b603a5b27 |
13 | 69bbc96184c2 |
14 | 2dc88b7a3ad9 |
15 | 1604128a99e1 |
hex | b05eeda360f |
12120110020111 has 8 divisors (see below), whose sum is σ = 12136715775360. Its totient is φ = 12103504820568.
The previous prime is 12120110020013. The next prime is 12120110020121. The reversal of 12120110020111 is 11102001102121.
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 12120110020111 - 215 = 12120109987343 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12120110020091 and 12120110020100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120110020121) 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, 63212190 + ... + 63403636.
It is an arithmetic number, because the mean of its divisors is an integer number (1517089471920).
Almost surely, 212120110020111 is an apocalyptic number.
12120110020111 is a deficient number, since it is larger than the sum of its proper divisors (16605755249).
12120110020111 is an equidigital number, since it uses as much as digits as its factorization.
12120110020111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277853.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12120110020111 its reverse (11102001102121), we get a palindrome (23222111122232).
The spelling of 12120110020111 in words is "twelve trillion, one hundred twenty billion, one hundred ten million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •