Base | Representation |
---|---|
bin | 11001000010011101001111… |
… | …011110111110011001011111 |
3 | 112102220100222010202111221110 |
4 | 121002131033132332121133 |
5 | 103413201230001201421 |
6 | 1030112232444433103 |
7 | 32123623154053452 |
oct | 3102351736763137 |
9 | 472810863674843 |
10 | 110120000022111 |
11 | 320a66a220a992 |
12 | 10425bb1248793 |
13 | 495a36b4958c1 |
14 | 1d29b9d291499 |
15 | cae7196bea76 |
hex | 64274f7be65f |
110120000022111 has 8 divisors (see below), whose sum is σ = 146832453526320. Its totient is φ = 73410439932992.
The previous prime is 110120000022101. The next prime is 110120000022187. The reversal of 110120000022111 is 111220000021011.
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 110120000022111 - 26 = 110120000022047 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110120000022101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 723264966 + ... + 723417203.
It is an arithmetic number, because the mean of its divisors is an integer number (18354056690790).
Almost surely, 2110120000022111 is an apocalyptic number.
110120000022111 is a deficient number, since it is larger than the sum of its proper divisors (36712453504209).
110120000022111 is a wasteful number, since it uses less digits than its factorization.
110120000022111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1446707545.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110120000022111 its reverse (111220000021011), we get a palindrome (221340000043122).
The spelling of 110120000022111 in words is "one hundred ten trillion, one hundred twenty billion, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •