Base | Representation |
---|---|
bin | 1011000001011110100101… |
… | …1111100100101100011111 |
3 | 1120220122220001002102011211 |
4 | 2300113221133210230133 |
5 | 3042033300122010421 |
6 | 41435505501325251 |
7 | 2360433253062664 |
oct | 260275137445437 |
9 | 46818801072154 |
10 | 12120020110111 |
11 | 3953087424a51 |
12 | 1438b36266827 |
13 | 69bbb3ac8514 |
14 | 2dc87d87ba6b |
15 | 160409a499e1 |
hex | b05e97e4b1f |
12120020110111 has 8 divisors (see below), whose sum is σ = 12758037202800. Its totient is φ = 11482015147200.
The previous prime is 12120020110019. The next prime is 12120020110129. The reversal of 12120020110111 is 11101102002121.
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 12120020110111 - 219 = 12120019585823 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12120020110091 and 12120020110100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12120020110151) 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, 944590 + ... + 5013211.
It is an arithmetic number, because the mean of its divisors is an integer number (1594754650350).
Almost surely, 212120020110111 is an apocalyptic number.
12120020110111 is a deficient number, since it is larger than the sum of its proper divisors (638017092689).
12120020110111 is a wasteful number, since it uses less digits than its factorization.
12120020110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6064889.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12120020110111 its reverse (11101102002121), we get a palindrome (23221122112232).
The spelling of 12120020110111 in words is "twelve trillion, one hundred twenty billion, twenty million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •