Base | Representation |
---|---|
bin | 11000100010110101110 |
3 | 1111212020210 |
4 | 3010112232 |
5 | 201214040 |
6 | 25123250 |
7 | 6556545 |
oct | 3042656 |
9 | 1455223 |
10 | 804270 |
11 | 4aa295 |
12 | 329526 |
13 | 2220cc |
14 | 16d15c |
15 | 10d480 |
hex | c45ae |
804270 has 64 divisors (see below), whose sum is σ = 2177280. Its totient is φ = 188928.
The previous prime is 804259. The next prime is 804281. The reversal of 804270 is 72408.
It is a happy number.
804270 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 (804259) and next prime (804281).
It is an Ulam number.
It is a congruent number.
It is an unprimeable number.
804270 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9649 + ... + 9731.
It is an arithmetic number, because the mean of its divisors is an integer number (34020).
2804270 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 804270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1088640).
804270 is an abundant number, since it is smaller than the sum of its proper divisors (1373010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
804270 is a wasteful number, since it uses less digits than its factorization.
804270 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129.
The product of its (nonzero) digits is 448, while the sum is 21.
The square root of 804270 is about 896.8110168815. The cubic root of 804270 is about 92.9966468903.
Adding to 804270 its reverse (72408), we get a palindrome (876678).
The spelling of 804270 in words is "eight hundred four thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •