Base | Representation |
---|---|
bin | 10101110001000100010000 |
3 | 101201220011100 |
4 | 111301010100 |
5 | 2430043000 |
6 | 322144400 |
7 | 66333366 |
oct | 25610420 |
9 | 11656140 |
10 | 5706000 |
11 | 3248003 |
12 | 1ab2100 |
13 | 124a241 |
14 | a87636 |
15 | 77aa00 |
hex | 571110 |
5706000 has 120 divisors (see below), whose sum is σ = 19992024. Its totient is φ = 1516800.
The previous prime is 5705981. The next prime is 5706013. The reversal of 5706000 is 6075.
5706000 is nontrivially palindromic in base 7.
It can be written as a sum of positive squares in 4 ways, for example, as 1245456 + 4460544 = 1116^2 + 2112^2 .
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an Ulam number.
It is a zygodrome in base 7 and base 15.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17842 + ... + 18158.
Almost surely, 25706000 is an apocalyptic number.
5706000 is a gapful number since it is divisible by the number (50) 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 5706000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9996012).
5706000 is an abundant number, since it is smaller than the sum of its proper divisors (14286024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5706000 is a wasteful number, since it uses less digits than its factorization.
5706000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 346 (or 327 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 18.
The square root of 5706000 is about 2388.7235084873. The cubic root of 5706000 is about 178.6942545454.
The spelling of 5706000 in words is "five million, seven hundred six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •