Base | Representation |
---|---|
bin | 11110100111101101101… |
… | …11000011011001100000 |
3 | 10201120200121102222222112 |
4 | 33103312313003121200 |
5 | 114214212043202300 |
6 | 2123200114454452 |
7 | 136004233305350 |
oct | 17236667033140 |
9 | 3646617388875 |
10 | 1052113647200 |
11 | 3762207a8410 |
12 | 14baa6894428 |
13 | 782a1bc4085 |
14 | 38ccb776b60 |
15 | 1c57b96be35 |
hex | f4f6dc3660 |
1052113647200 has 144 divisors (see below), whose sum is σ = 3202251542784. Its totient is φ = 327931507200.
The previous prime is 1052113647119. The next prime is 1052113647227. The reversal of 1052113647200 is 27463112501.
It is a super-2 number, since 2×10521136472002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8478284 + ... + 8601483.
It is an arithmetic number, because the mean of its divisors is an integer number (22237857936).
Almost surely, 21052113647200 is an apocalyptic number.
1052113647200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1052113647200 is an abundant number, since it is smaller than the sum of its proper divisors (2150137895584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1052113647200 is a wasteful number, since it uses less digits than its factorization.
1052113647200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17079805 (or 17079792 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 32.
Adding to 1052113647200 its reverse (27463112501), we get a palindrome (1079576759701).
The spelling of 1052113647200 in words is "one trillion, fifty-two billion, one hundred thirteen million, six hundred forty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •