Base | Representation |
---|---|
bin | 10100010011000110… |
… | …01010000110100000 |
3 | 1001010110210221110010 |
4 | 22021203022012200 |
5 | 134304243121400 |
6 | 5001210004520 |
7 | 534024215604 |
oct | 121143120640 |
9 | 31113727403 |
10 | 10897629600 |
11 | 4692478460 |
12 | 2141716740 |
13 | 1048963c50 |
14 | 755463504 |
15 | 43babc450 |
hex | 2898ca1a0 |
10897629600 has 576 divisors, whose sum is σ = 42191549568. Its totient is φ = 2408448000.
The previous prime is 10897629593. The next prime is 10897629637. The reversal of 10897629600 is 692679801.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 10897629600.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 38781460 + ... + 38781740.
It is an arithmetic number, because the mean of its divisors is an integer number (73249218).
Almost surely, 210897629600 is an apocalyptic number.
10897629600 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 10897629600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21095774784).
10897629600 is an abundant number, since it is smaller than the sum of its proper divisors (31293919968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10897629600 is a wasteful number, since it uses less digits than its factorization.
10897629600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 441 (or 428 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 48.
The spelling of 10897629600 in words is "ten billion, eight hundred ninety-seven million, six hundred twenty-nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •