Base | Representation |
---|---|
bin | 1101011100101… |
… | …1010011010000 |
3 | 10221010210012100 |
4 | 3113023103100 |
5 | 103420012443 |
6 | 5333000400 |
7 | 1253311422 |
oct | 327132320 |
9 | 127123170 |
10 | 56407248 |
11 | 29927667 |
12 | 16a83100 |
13 | b8bc891 |
14 | 76c4812 |
15 | 4e433d3 |
hex | 35cb4d0 |
56407248 has 30 divisors (see below), whose sum is σ = 157862354. Its totient is φ = 18802368.
The previous prime is 56407243. The next prime is 56407261. The reversal of 56407248 is 84270465.
56407248 is a `hidden beast` number, since 5 + 6 + 407 + 248 = 666.
56407248 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 50296464 + 6110784 = 7092^2 + 2472^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56407243) 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 5 ways as a sum of consecutive naturals, for example, 195715 + ... + 196002.
Almost surely, 256407248 is an apocalyptic number.
It is an amenable number.
56407248 is an abundant number, since it is smaller than the sum of its proper divisors (101455106).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56407248 is a wasteful number, since it uses less digits than its factorization.
56407248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391731 (or 391722 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 36.
The square root of 56407248 is about 7510.4758837240. The cubic root of 56407248 is about 383.5114229001.
The spelling of 56407248 in words is "fifty-six million, four hundred seven thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •