Base | Representation |
---|---|
bin | 1000010111111… |
… | …00010000000000 |
3 | 11220011112010001 |
4 | 10023330100000 |
5 | 120440123412 |
6 | 10545245344 |
7 | 1512011050 |
oct | 413742000 |
9 | 156145101 |
10 | 70239232 |
11 | 36714858 |
12 | 1b633854 |
13 | 1172369b |
14 | 9485560 |
15 | 6276957 |
hex | 42fc400 |
70239232 has 88 divisors (see below), whose sum is σ = 165070080. Its totient is φ = 29245440.
The previous prime is 70239203. The next prime is 70239233. The reversal of 70239232 is 23293207.
It is a hoax number, since the sum of its digits (28) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 70239232.
It is not an unprimeable number, because it can be changed into a prime (70239233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 293769 + ... + 294007.
Almost surely, 270239232 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 70239232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82535040).
70239232 is an abundant number, since it is smaller than the sum of its proper divisors (94830848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70239232 is a wasteful number, since it uses less digits than its factorization.
70239232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307 (or 289 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 28.
The square root of 70239232 is about 8380.8849174774. The cubic root of 70239232 is about 412.5974929646.
The spelling of 70239232 in words is "seventy million, two hundred thirty-nine thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •