Base | Representation |
---|---|
bin | 101010000001111… |
… | …101011110111010 |
3 | 1211010212200121210 |
4 | 222001331132322 |
5 | 2421010011200 |
6 | 153545543550 |
7 | 23321510313 |
oct | 5201753672 |
9 | 1733780553 |
10 | 705157050 |
11 | 332051a24 |
12 | 1781a4bb6 |
13 | b31267c0 |
14 | 6991b60a |
15 | 41d90650 |
hex | 2a07d7ba |
705157050 has 96 divisors (see below), whose sum is σ = 1919127168. Its totient is φ = 170277120.
The previous prime is 705157039. The next prime is 705157109. The reversal of 705157050 is 50751507.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 705156999 and 705157017.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 99939 + ... + 106761.
It is an arithmetic number, because the mean of its divisors is an integer number (19990908).
Almost surely, 2705157050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 705157050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (959563584).
705157050 is an abundant number, since it is smaller than the sum of its proper divisors (1213970118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
705157050 is a wasteful number, since it uses less digits than its factorization.
705157050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6904 (or 6899 counting only the distinct ones).
The product of its (nonzero) digits is 6125, while the sum is 30.
The square root of 705157050 is about 26554.7933526134. The cubic root of 705157050 is about 890.0791285956.
The spelling of 705157050 in words is "seven hundred five million, one hundred fifty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •