Base | Representation |
---|---|
bin | 110100010100110100… |
… | …0001110011101101000 |
3 | 101202001002101111212221 |
4 | 1220221220032131220 |
5 | 3320112043414202 |
6 | 123342042443424 |
7 | 11055400335232 |
oct | 1505150163550 |
9 | 352032344787 |
10 | 112367560552 |
11 | 43722616425 |
12 | 1993b803574 |
13 | a799b68400 |
14 | 561d7db252 |
15 | 2dc9db2037 |
hex | 1a29a0e768 |
112367560552 has 48 divisors (see below), whose sum is σ = 234308840940. Its totient is φ = 50460254208.
The previous prime is 112367560477. The next prime is 112367560561. The reversal of 112367560552 is 255065763211.
It can be written as a sum of positive squares in 6 ways, for example, as 9515222116 + 102852338436 = 97546^2 + 320706^2 .
It is a junction number, because it is equal to n+sod(n) for n = 112367560499 and 112367560508.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1073113 + ... + 1173160.
Almost surely, 2112367560552 is an apocalyptic number.
It is an amenable number.
112367560552 is an abundant number, since it is smaller than the sum of its proper divisors (121941280388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112367560552 is a wasteful number, since it uses less digits than its factorization.
112367560552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2246342 (or 2246325 counting only the distinct ones).
The product of its (nonzero) digits is 378000, while the sum is 43.
The spelling of 112367560552 in words is "one hundred twelve billion, three hundred sixty-seven million, five hundred sixty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •