Base | Representation |
---|---|
bin | 110100001101110101… |
… | …0101101110011111111 |
3 | 101201102202122111000122 |
4 | 1220123222231303333 |
5 | 3314122113112343 |
6 | 123302514245155 |
7 | 11046524411633 |
oct | 1503352556377 |
9 | 351382574018 |
10 | 112133332223 |
11 | 436123851a0 |
12 | 198952867bb |
13 | a760488673 |
14 | 55da668dc3 |
15 | 2db4546068 |
hex | 1a1baadcff |
112133332223 has 4 divisors (see below), whose sum is σ = 122327271528. Its totient is φ = 101939392920.
The previous prime is 112133332217. The next prime is 112133332229. The reversal of 112133332223 is 322233331211.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (112133332217) and next prime (112133332229).
It is a cyclic number.
It is not a de Polignac number, because 112133332223 - 210 = 112133331199 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112133332192 and 112133332201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112133332229) 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, 5096969636 + ... + 5096969657.
It is an arithmetic number, because the mean of its divisors is an integer number (30581817882).
Almost surely, 2112133332223 is an apocalyptic number.
112133332223 is a deficient number, since it is larger than the sum of its proper divisors (10193939305).
112133332223 is a wasteful number, since it uses less digits than its factorization.
112133332223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10193939304.
The product of its digits is 3888, while the sum is 26.
Adding to 112133332223 its reverse (322233331211), we get a palindrome (434366663434).
The spelling of 112133332223 in words is "one hundred twelve billion, one hundred thirty-three million, three hundred thirty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •