Base | Representation |
---|---|
bin | 101010000001100… |
… | …101000011101000 |
3 | 1211010200121101020 |
4 | 222001211003220 |
5 | 2420443311000 |
6 | 153543452440 |
7 | 23320612524 |
oct | 5201450350 |
9 | 1733617336 |
10 | 705057000 |
11 | 331a9383a |
12 | 178157120 |
13 | b30c00bb |
14 | 698d2d84 |
15 | 41d70ba0 |
hex | 2a0650e8 |
705057000 has 128 divisors (see below), whose sum is σ = 2212704000. Its totient is φ = 186912000.
The previous prime is 705056999. The next prime is 705057007. The reversal of 705057000 is 750507.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (705057007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 596410 + ... + 597590.
It is an arithmetic number, because the mean of its divisors is an integer number (17286750).
Almost surely, 2705057000 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 705057000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1106352000).
705057000 is an abundant number, since it is smaller than the sum of its proper divisors (1507647000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
705057000 is a wasteful number, since it uses less digits than its factorization.
705057000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1404 (or 1390 counting only the distinct ones).
The product of its (nonzero) digits is 1225, while the sum is 24.
The square root of 705057000 is about 26552.9094451060. The cubic root of 705057000 is about 890.0370308204.
The spelling of 705057000 in words is "seven hundred five million, fifty-seven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •