Base | Representation |
---|---|
bin | 1101100000101… |
… | …1111000011010 |
3 | 10221122020001110 |
4 | 3120023320122 |
5 | 104001444040 |
6 | 5342401150 |
7 | 1255462551 |
oct | 330137032 |
9 | 127566043 |
10 | 56671770 |
11 | 29a98381 |
12 | 16b901b6 |
13 | b9830bc |
14 | 7752d98 |
15 | 4e96980 |
hex | 360be1a |
56671770 has 48 divisors (see below), whose sum is σ = 142222752. Its totient is φ = 14451360.
The previous prime is 56671739. The next prime is 56671777. The reversal of 56671770 is 7717665.
56671770 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 (56671777) 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 23 ways as a sum of consecutive naturals, for example, 14085 + ... + 17655.
It is an arithmetic number, because the mean of its divisors is an integer number (2962974).
Almost surely, 256671770 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56671770, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71111376).
56671770 is an abundant number, since it is smaller than the sum of its proper divisors (85550982).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56671770 is a wasteful number, since it uses less digits than its factorization.
56671770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3627 (or 3604 counting only the distinct ones).
The product of its (nonzero) digits is 61740, while the sum is 39.
The square root of 56671770 is about 7528.0654885568. The cubic root of 56671770 is about 384.1099809758.
The spelling of 56671770 in words is "fifty-six million, six hundred seventy-one thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •