Base | Representation |
---|---|
bin | 110100010111011011… |
… | …0100110010101100001 |
3 | 101202021012022210101222 |
4 | 1220232312212111201 |
5 | 3320302013330213 |
6 | 123354453304425 |
7 | 11060513360012 |
oct | 1505666462541 |
9 | 352235283358 |
10 | 112455214433 |
11 | 43768045051 |
12 | 19965035115 |
13 | a7b2078503 |
14 | 562b2d7009 |
15 | 2dd2928808 |
hex | 1a2eda6561 |
112455214433 has 16 divisors (see below), whose sum is σ = 114659301120. Its totient is φ = 110271642624.
The previous prime is 112455214429. The next prime is 112455214451. The reversal of 112455214433 is 334412554211.
It is a cyclic number.
It is not a de Polignac number, because 112455214433 - 22 = 112455214429 is a prime.
It is a super-2 number, since 2×1124552144332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112455214393 and 112455214402.
It is not an unprimeable number, because it can be changed into a prime (112455214423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27207035 + ... + 27211167.
It is an arithmetic number, because the mean of its divisors is an integer number (7166206320).
Almost surely, 2112455214433 is an apocalyptic number.
It is an amenable number.
112455214433 is a deficient number, since it is larger than the sum of its proper divisors (2204086687).
112455214433 is a wasteful number, since it uses less digits than its factorization.
112455214433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6488.
The product of its digits is 57600, while the sum is 35.
Adding to 112455214433 its reverse (334412554211), we get a palindrome (446867768644).
The spelling of 112455214433 in words is "one hundred twelve billion, four hundred fifty-five million, two hundred fourteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •