Base | Representation |
---|---|
bin | 100001001010011… |
… | …1111101100110100 |
3 | 2212112221002200202 |
4 | 1002110333230310 |
5 | 4234334100202 |
6 | 302231100032 |
7 | 36401434010 |
oct | 10224775464 |
9 | 2775832622 |
10 | 1112800052 |
11 | 521168171 |
12 | 270811618 |
13 | 149712b90 |
14 | a7b11540 |
15 | 67a63802 |
hex | 4253fb34 |
1112800052 has 96 divisors (see below), whose sum is σ = 2461734912. Its totient is φ = 428478336.
The previous prime is 1112800021. The next prime is 1112800061. The reversal of 1112800052 is 2500082111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1112799997 and 1112800033.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2511743 + ... + 2512185.
It is an arithmetic number, because the mean of its divisors is an integer number (25643072).
Almost surely, 21112800052 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1112800052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1230867456).
1112800052 is an abundant number, since it is smaller than the sum of its proper divisors (1348934860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112800052 is a wasteful number, since it uses less digits than its factorization.
1112800052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 637 (or 635 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 20.
The square root of 1112800052 is about 33358.6578267172. The cubic root of 1112800052 is about 1036.2686961753.
Adding to 1112800052 its reverse (2500082111), we get a palindrome (3612882163).
The spelling of 1112800052 in words is "one billion, one hundred twelve million, eight hundred thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •