Base | Representation |
---|---|
bin | 1101011110100… |
… | …0100011111100 |
3 | 10221100212121022 |
4 | 3113220203330 |
5 | 103432331400 |
6 | 5335323312 |
7 | 1254321020 |
oct | 327504374 |
9 | 127325538 |
10 | 56527100 |
11 | 299a9713 |
12 | 16b20538 |
13 | b9322b6 |
14 | 7716380 |
15 | 4e68b85 |
hex | 35e88fc |
56527100 has 72 divisors (see below), whose sum is σ = 146323968. Its totient is φ = 18532800.
The previous prime is 56527099. The next prime is 56527103. The reversal of 56527100 is 172565.
It is a self number, because there is not a number n which added to its sum of digits gives 56527100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56527103) 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, 14345 + ... + 17855.
Almost surely, 256527100 is an apocalyptic number.
56527100 is a gapful number since it is divisible by the number (50) 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 56527100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73161984).
56527100 is an abundant number, since it is smaller than the sum of its proper divisors (89796868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56527100 is a wasteful number, since it uses less digits than its factorization.
56527100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3555 (or 3548 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 26.
The square root of 56527100 is about 7518.4506382632. The cubic root of 56527100 is about 383.7828542997.
Adding to 56527100 its reverse (172565), we get a palindrome (56699665).
The spelling of 56527100 in words is "fifty-six million, five hundred twenty-seven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •