Base | Representation |
---|---|
bin | 100000110010101011… |
… | …1000011001000111000 |
3 | 20201202200200112212110 |
4 | 1001211113003020320 |
5 | 2123210011031340 |
6 | 52203413212320 |
7 | 5042034163053 |
oct | 1014527031070 |
9 | 221680615773 |
10 | 70420017720 |
11 | 2795729a658 |
12 | 117936310a0 |
13 | 6843477450 |
14 | 35a070ba9a |
15 | 1c7242a680 |
hex | 10655c3238 |
70420017720 has 256 divisors, whose sum is σ = 231860160000. Its totient is φ = 17004349440.
The previous prime is 70420017709. The next prime is 70420017727. The reversal of 70420017720 is 2771002407.
It is a super-2 number, since 2×704200177202 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70420017727) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 47484099 + ... + 47485581.
It is an arithmetic number, because the mean of its divisors is an integer number (905703750).
Almost surely, 270420017720 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 70420017720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (115930080000).
70420017720 is an abundant number, since it is smaller than the sum of its proper divisors (161440142280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70420017720 is a wasteful number, since it uses less digits than its factorization.
70420017720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2070 (or 2066 counting only the distinct ones).
The product of its (nonzero) digits is 5488, while the sum is 30.
The spelling of 70420017720 in words is "seventy billion, four hundred twenty million, seventeen thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.143 sec. • engine limits •