Base | Representation |
---|---|
bin | 11110000010010000001… |
… | …11010000000001000000 |
3 | 10122122202222212000221010 |
4 | 33001020013100001000 |
5 | 113402020003324300 |
6 | 2110032320400520 |
7 | 134362654234146 |
oct | 17011007200100 |
9 | 3578688760833 |
10 | 1032002011200 |
11 | 36874025a636 |
12 | 148013476140 |
13 | 76418360544 |
14 | 37d40711596 |
15 | 1bca0eeda50 |
hex | f0481d0040 |
1032002011200 has 168 divisors, whose sum is σ = 3457866218112. Its totient is φ = 269345146880.
The previous prime is 1032002011081. The next prime is 1032002011219. The reversal of 1032002011200 is 21102002301.
It is a super-3 number, since 3×10320020112003 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2061639 + ... + 2512838.
Almost surely, 21032002011200 is an apocalyptic number.
1032002011200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1032002011200 is an abundant number, since it is smaller than the sum of its proper divisors (2425864206912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032002011200 is a wasteful number, since it uses less digits than its factorization.
1032002011200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4574549 (or 4574534 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1032002011200 its reverse (21102002301), we get a palindrome (1053104013501).
The spelling of 1032002011200 in words is "one trillion, thirty-two billion, two million, eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •