Base | Representation |
---|---|
bin | 10100001110010100… |
… | …01011011110100000 |
3 | 1001000200100112022001 |
4 | 22013022023132200 |
5 | 134214011332300 |
6 | 4553214253344 |
7 | 533026313152 |
oct | 120712133640 |
9 | 31020315261 |
10 | 10857527200 |
11 | 4671877983 |
12 | 21301b7254 |
13 | 1040562910 |
14 | 74ddc4ad2 |
15 | 4382ea16a |
hex | 28728b7a0 |
10857527200 has 288 divisors, whose sum is σ = 31366742400. Its totient is φ = 3631288320.
The previous prime is 10857527137. The next prime is 10857527201. The reversal of 10857527200 is 272575801.
It is a self number, because there is not a number n which added to its sum of digits gives 10857527200.
It is not an unprimeable number, because it can be changed into a prime (10857527201) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4543606 + ... + 4545994.
It is an arithmetic number, because the mean of its divisors is an integer number (108912300).
Almost surely, 210857527200 is an apocalyptic number.
10857527200 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 10857527200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15683371200).
10857527200 is an abundant number, since it is smaller than the sum of its proper divisors (20509215200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10857527200 is a wasteful number, since it uses less digits than its factorization.
10857527200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2464 (or 2451 counting only the distinct ones).
The product of its (nonzero) digits is 39200, while the sum is 37.
The spelling of 10857527200 in words is "ten billion, eight hundred fifty-seven million, five hundred twenty-seven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •