Base | Representation |
---|---|
bin | 1101011000011… |
… | …0111011011000 |
3 | 10220121120000220 |
4 | 3112012323120 |
5 | 103332032232 |
6 | 5323000040 |
7 | 1251034062 |
oct | 326067330 |
9 | 126546026 |
10 | 56127192 |
11 | 29756210 |
12 | 16969020 |
13 | b822274 |
14 | 7650732 |
15 | 4dda42c |
hex | 3586ed8 |
56127192 has 64 divisors (see below), whose sum is σ = 153740160. Its totient is φ = 16934400.
The previous prime is 56127191. The next prime is 56127193. The reversal of 56127192 is 29172165.
It is an interprime number because it is at equal distance from previous prime (56127191) and next prime (56127193).
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56127191) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 114067 + ... + 114557.
It is an arithmetic number, because the mean of its divisors is an integer number (2402190).
Almost surely, 256127192 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56127192, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76870080).
56127192 is an abundant number, since it is smaller than the sum of its proper divisors (97612968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56127192 is a wasteful number, since it uses less digits than its factorization.
56127192 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 944 (or 940 counting only the distinct ones).
The product of its digits is 7560, while the sum is 33.
The square root of 56127192 is about 7491.8083264323. The cubic root of 56127192 is about 382.8756717528.
The spelling of 56127192 in words is "fifty-six million, one hundred twenty-seven thousand, one hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •