Base | Representation |
---|---|
bin | 11001011111011010100100… |
… | …101110111000001001010011 |
3 | 112200221121111200000022101012 |
4 | 121133122210232320021103 |
5 | 104143302240012042321 |
6 | 1034234342325001135 |
7 | 32420452212533333 |
oct | 3137324456701123 |
9 | 480847450008335 |
10 | 112110000112211 |
11 | 327a36473a8422 |
12 | 106a78042531ab |
13 | 4a72c0a07180a |
14 | 1d9821da030c3 |
15 | ce638980b05b |
hex | 65f6a4bb8253 |
112110000112211 has 4 divisors (see below), whose sum is σ = 113220000113424. Its totient is φ = 111000000111000.
The previous prime is 112110000112207. The next prime is 112110000112247. The reversal of 112110000112211 is 112211000011211.
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 112110000112211 - 22 = 112110000112207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112110000112511) 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, 555000000455 + ... + 555000000656.
It is an arithmetic number, because the mean of its divisors is an integer number (28305000028356).
Almost surely, 2112110000112211 is an apocalyptic number.
112110000112211 is a deficient number, since it is larger than the sum of its proper divisors (1110000001213).
112110000112211 is a wasteful number, since it uses less digits than its factorization.
112110000112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1110000001212.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 112110000112211 its reverse (112211000011211), we get a palindrome (224321000123422).
It can be divided in two parts, 112110000 and 112211, that added together give a palindrome (112222211).
The spelling of 112110000112211 in words is "one hundred twelve trillion, one hundred ten billion, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •