Base | Representation |
---|---|
bin | 1101100010111… |
… | …0011000001110 |
3 | 10221220101212210 |
4 | 3120232120032 |
5 | 104021004240 |
6 | 5345411250 |
7 | 1256621526 |
oct | 330563016 |
9 | 127811783 |
10 | 56813070 |
11 | 2a084556 |
12 | 17039b26 |
13 | ba02502 |
14 | 778c686 |
15 | 4ec3780 |
hex | 362e60e |
56813070 has 32 divisors (see below), whose sum is σ = 136608768. Its totient is φ = 15121568.
The previous prime is 56813063. The next prime is 56813077. The reversal of 56813070 is 7031865.
56813070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (56813063) and next prime (56813077).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56813077) 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 15 ways as a sum of consecutive naturals, for example, 17947 + ... + 20873.
It is an arithmetic number, because the mean of its divisors is an integer number (4269024).
Almost surely, 256813070 is an apocalyptic number.
56813070 is an abundant number, since it is smaller than the sum of its proper divisors (79795698).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56813070 is a wasteful number, since it uses less digits than its factorization.
56813070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3584.
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 56813070 is about 7537.4445271591. Note that the first 3 decimals coincide. The cubic root of 56813070 is about 384.4289504548.
The spelling of 56813070 in words is "fifty-six million, eight hundred thirteen thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •