Base | Representation |
---|---|
bin | 110100010000001001… |
… | …1011010100010010001 |
3 | 101201122012000000010021 |
4 | 1220200103122202101 |
5 | 3314302021010113 |
6 | 123314333303441 |
7 | 11051460461251 |
oct | 1504023324221 |
9 | 351565000107 |
10 | 112211110033 |
11 | 43652278880 |
12 | 198b7334b81 |
13 | a77361b439 |
14 | 5606b13961 |
15 | 2dbb2ab48d |
hex | 1a204da891 |
112211110033 has 8 divisors (see below), whose sum is σ = 122423142816. Its totient is φ = 102000914400.
The previous prime is 112211110003. The next prime is 112211110073. The reversal of 112211110033 is 330011112211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112211110033 - 25 = 112211110001 is a prime.
It is a super-2 number, since 2×1122111100332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 112211109989 and 112211110016.
It is not an unprimeable number, because it can be changed into a prime (112211110003) 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, 329988 + ... + 577333.
It is an arithmetic number, because the mean of its divisors is an integer number (15302892852).
Almost surely, 2112211110033 is an apocalyptic number.
It is an amenable number.
112211110033 is a deficient number, since it is larger than the sum of its proper divisors (10212032783).
112211110033 is a wasteful number, since it uses less digits than its factorization.
112211110033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 918575.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 112211110033 its reverse (330011112211), we get a palindrome (442222222244).
The spelling of 112211110033 in words is "one hundred twelve billion, two hundred eleven million, one hundred ten thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •