Base | Representation |
---|---|
bin | 1101011011111… |
… | …0010100100000 |
3 | 10221001002021011 |
4 | 3112332110200 |
5 | 103411312310 |
6 | 5331510304 |
7 | 1253000416 |
oct | 326762440 |
9 | 127032234 |
10 | 56354080 |
11 | 298a0722 |
12 | 16a58394 |
13 | b8a1613 |
14 | 76ad2b6 |
15 | 4e3278a |
hex | 35be520 |
56354080 has 48 divisors (see below), whose sum is σ = 136249344. Its totient is φ = 22014720.
The previous prime is 56354059. The next prime is 56354087. The reversal of 56354080 is 8045365.
56354080 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (56354087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2785 + ... + 10975.
It is an arithmetic number, because the mean of its divisors is an integer number (2838528).
Almost surely, 256354080 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 56354080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68124672).
56354080 is an abundant number, since it is smaller than the sum of its proper divisors (79895264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56354080 is a wasteful number, since it uses less digits than its factorization.
56354080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8249 (or 8241 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 56354080 is about 7506.9354599597. The cubic root of 56354080 is about 383.3908890684.
The spelling of 56354080 in words is "fifty-six million, three hundred fifty-four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •