Base | Representation |
---|---|
bin | 1000011001010… |
… | …00100110100000 |
3 | 11220111202022100 |
4 | 10030220212200 |
5 | 121011432041 |
6 | 10553210400 |
7 | 1513365510 |
oct | 414504640 |
9 | 156452270 |
10 | 70420896 |
11 | 36829297 |
12 | 1b700a00 |
13 | 11788290 |
14 | 94d1840 |
15 | 62b06b6 |
hex | 43289a0 |
70420896 has 144 divisors (see below), whose sum is σ = 246564864. Its totient is φ = 18565632.
The previous prime is 70420841. The next prime is 70420907. The reversal of 70420896 is 69802407.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 70420896.
It is a congruent number.
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, 24865 + ... + 27551.
It is an arithmetic number, because the mean of its divisors is an integer number (1712256).
Almost surely, 270420896 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 70420896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123282432).
70420896 is an abundant number, since it is smaller than the sum of its proper divisors (176143968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70420896 is a wasteful number, since it uses less digits than its factorization.
70420896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2723 (or 2712 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 70420896 is about 8391.7159151153. The cubic root of 70420896 is about 412.9528954088.
The spelling of 70420896 in words is "seventy million, four hundred twenty thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •