Base | Representation |
---|---|
bin | 110100010000100000… |
… | …0111001001110010011 |
3 | 101201200000102201021102 |
4 | 1220201000321032103 |
5 | 3314313044012321 |
6 | 123315441015015 |
7 | 11051664014633 |
oct | 1504100711623 |
9 | 351600381242 |
10 | 112223032211 |
11 | 43658a81114 |
12 | 198bb32446b |
13 | a775c33b94 |
14 | 56085386c3 |
15 | 2dbc363c0b |
hex | 1a21039393 |
112223032211 has 8 divisors (see below), whose sum is σ = 112903369584. Its totient is φ = 111544693920.
The previous prime is 112223032193. The next prime is 112223032213. The reversal of 112223032211 is 112230322211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112223032211 is a prime.
It is a super-2 number, since 2×1122230322112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112223032213) 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, 387080 + ... + 611781.
It is an arithmetic number, because the mean of its divisors is an integer number (14112921198).
Almost surely, 2112223032211 is an apocalyptic number.
112223032211 is a deficient number, since it is larger than the sum of its proper divisors (680337373).
112223032211 is an equidigital number, since it uses as much as digits as its factorization.
112223032211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 999541.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 112223032211 its reverse (112230322211), we get a palindrome (224453354422).
Subtracting 112223032211 from its reverse (112230322211), we obtain a square (7290000 = 27002).
The spelling of 112223032211 in words is "one hundred twelve billion, two hundred twenty-three million, thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •