Base | Representation |
---|---|
bin | 1101011001101… |
… | …1110101100000 |
3 | 10220202220111202 |
4 | 3112123311200 |
5 | 103342302312 |
6 | 5324500332 |
7 | 1251541544 |
oct | 326336540 |
9 | 126686452 |
10 | 56212832 |
11 | 29804595 |
12 | 169aa6a8 |
13 | b852240 |
14 | 7673a24 |
15 | 4e059c2 |
hex | 359bd60 |
56212832 has 48 divisors (see below), whose sum is σ = 120057840. Its totient is φ = 25754112.
The previous prime is 56212823. The next prime is 56212837. The reversal of 56212832 is 23821265.
It is a junction number, because it is equal to n+sod(n) for n = 56212795 and 56212804.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56212837) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 67394 + ... + 68222.
It is an arithmetic number, because the mean of its divisors is an integer number (2501205).
Almost surely, 256212832 is an apocalyptic number.
56212832 is a gapful number since it is divisible by the number (52) 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 56212832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60028920).
56212832 is an abundant number, since it is smaller than the sum of its proper divisors (63845008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56212832 is a wasteful number, since it uses less digits than its factorization.
56212832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1015 (or 1007 counting only the distinct ones).
The product of its digits is 5760, while the sum is 29.
The square root of 56212832 is about 7497.5217238765. The cubic root of 56212832 is about 383.0703059312.
The spelling of 56212832 in words is "fifty-six million, two hundred twelve thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •