Base | Representation |
---|---|
bin | 10100001010100001… |
… | …00000100100000000 |
3 | 1000221110100002022100 |
4 | 22011100200210000 |
5 | 134132330211000 |
6 | 4550114510400 |
7 | 532161232221 |
oct | 120520404400 |
9 | 30843302270 |
10 | 10825632000 |
11 | 4655872607 |
12 | 2121595400 |
13 | 1036a76111 |
14 | 749a81248 |
15 | 4355e9a00 |
hex | 285420900 |
10825632000 has 216 divisors, whose sum is σ = 38954817720. Its totient is φ = 2886758400.
The previous prime is 10825631981. The next prime is 10825632001. The reversal of 10825632000 is 23652801.
10825632000 is a `hidden beast` number, since 1 + 0 + 8 + 25 + 632 + 0 + 0 + 0 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 165482496 + 10660149504 = 12864^2 + 103248^2 .
It is not an unprimeable number, because it can be changed into a prime (10825632001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 269206 + ... + 306794.
Almost surely, 210825632000 is an apocalyptic number.
10825632000 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 10825632000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19477408860).
10825632000 is an abundant number, since it is smaller than the sum of its proper divisors (28129185720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10825632000 is an equidigital number, since it uses as much as digits as its factorization.
10825632000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37626 (or 37599 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 10825632000 in words is "ten billion, eight hundred twenty-five million, six hundred thirty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •