Base | Representation |
---|---|
bin | 1010000010001001100001… |
… | …0010100001110011010000 |
3 | 1110001122121012122120122010 |
4 | 2200202120102201303100 |
5 | 2421222044414310000 |
6 | 35244013423142520 |
7 | 2216016004240200 |
oct | 240423022416320 |
9 | 43048535576563 |
10 | 11032031010000 |
11 | 357372699a900 |
12 | 12a20b8a44a40 |
13 | 620415500100 |
14 | 2a1d4b62c400 |
15 | 141e7d76dd50 |
hex | a08984a1cd0 |
11032031010000 has 2700 divisors, whose sum is σ = 49442238369216. Its totient is φ = 2110268160000.
The previous prime is 11032031009981. The next prime is 11032031010037. The reversal of 11032031010000 is 1013023011.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 539 ways as a sum of consecutive naturals, for example, 30060029817 + ... + 30060030183.
Almost surely, 211032031010000 is an apocalyptic number.
11032031010000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11032031010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24721119184608).
11032031010000 is an abundant number, since it is smaller than the sum of its proper divisors (38410207359216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11032031010000 is a wasteful number, since it uses less digits than its factorization.
11032031010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 460 (or 408 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 11032031010000 its reverse (1013023011), we get a palindrome (11033044033011).
The spelling of 11032031010000 in words is "eleven trillion, thirty-two billion, thirty-one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •