Base | Representation |
---|---|
bin | 110100010000001000… |
… | …0000001110010000011 |
3 | 101201122010022220020222 |
4 | 1220200100001302003 |
5 | 3314301304102321 |
6 | 123314302253255 |
7 | 11051450102663 |
oct | 1504020016203 |
9 | 351563286228 |
10 | 112210222211 |
11 | 4365182183a |
12 | 198b6b8722b |
13 | a77339a2b9 |
14 | 56069621a3 |
15 | 2dbb1833ab |
hex | 1a20401c83 |
112210222211 has 16 divisors (see below), whose sum is σ = 118730108160. Its totient is φ = 105752213280.
The previous prime is 112210222147. The next prime is 112210222213. The reversal of 112210222211 is 112222012211.
It is a cyclic number.
It is not a de Polignac number, because 112210222211 - 26 = 112210222147 is a prime.
It is a super-2 number, since 2×1122102222112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112210222211.
It is not an unprimeable number, because it can be changed into a prime (112210222213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11208170 + ... + 11218176.
It is an arithmetic number, because the mean of its divisors is an integer number (7420631760).
Almost surely, 2112210222211 is an apocalyptic number.
112210222211 is a deficient number, since it is larger than the sum of its proper divisors (6519885949).
112210222211 is a wasteful number, since it uses less digits than its factorization.
112210222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13034.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 112210222211 its reverse (112222012211), we get a palindrome (224432234422).
The spelling of 112210222211 in words is "one hundred twelve billion, two hundred ten million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •