Base | Representation |
---|---|
bin | 1000011100001… |
… | …10101100110000 |
3 | 11221020100000022 |
4 | 10032012230300 |
5 | 121111300240 |
6 | 11005343012 |
7 | 1516562264 |
oct | 416065460 |
9 | 157210008 |
10 | 70806320 |
11 | 36a71922 |
12 | 1b867a68 |
13 | 11891840 |
14 | 95920a4 |
15 | 63399b5 |
hex | 4386b30 |
70806320 has 80 divisors (see below), whose sum is σ = 179280192. Its totient is φ = 25850880.
The previous prime is 70806319. The next prime is 70806341. The reversal of 70806320 is 2360807.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a self number, because there is not a number n which added to its sum of digits gives 70806320.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 106790 + ... + 107450.
Almost surely, 270806320 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 70806320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (89640096).
70806320 is an abundant number, since it is smaller than the sum of its proper divisors (108473872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70806320 is a wasteful number, since it uses less digits than its factorization.
70806320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 790 (or 784 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 70806320 is about 8414.6491311284. The cubic root of 70806320 is about 413.7049092436.
The spelling of 70806320 in words is "seventy million, eight hundred six thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •