Base | Representation |
---|---|
bin | 11001011101110100001110… |
… | …110101001100001001100011 |
3 | 112200120002212022021010111011 |
4 | 121131310032311030021203 |
5 | 104140002211404032321 |
6 | 1034112050220001351 |
7 | 32406512105522335 |
oct | 3135641665141143 |
9 | 480502768233434 |
10 | 112000111002211 |
11 | 32760a86907643 |
12 | 1068a456690257 |
13 | 4a6574682c0c3 |
14 | 1d92b97447455 |
15 | ce35a7319ae1 |
hex | 65dd0ed4c263 |
112000111002211 has 4 divisors (see below), whose sum is σ = 112010145966424. Its totient is φ = 111990076038000.
The previous prime is 112000111002173. The next prime is 112000111002217. The reversal of 112000111002211 is 112200111000211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112000111002211 - 29 = 112000111001699 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112000111002191 and 112000111002200.
It is not an unprimeable number, because it can be changed into a prime (112000111002217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5017465365 + ... + 5017487686.
It is an arithmetic number, because the mean of its divisors is an integer number (28002536491606).
Almost surely, 2112000111002211 is an apocalyptic number.
112000111002211 is a deficient number, since it is larger than the sum of its proper divisors (10034964213).
112000111002211 is a wasteful number, since it uses less digits than its factorization.
112000111002211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10034964212.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112000111002211 its reverse (112200111000211), we get a palindrome (224200222002422).
The spelling of 112000111002211 in words is "one hundred twelve trillion, one hundred eleven million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •