Base | Representation |
---|---|
bin | 100000110110110001… |
… | …0011010100110111000 |
3 | 20202010020211220101010 |
4 | 1001231202122212320 |
5 | 2124000121341120 |
6 | 52225153553520 |
7 | 5045321301435 |
oct | 1015542324670 |
9 | 222106756333 |
10 | 70557215160 |
11 | 27a17788073 |
12 | 118115758a0 |
13 | 6865a12c73 |
14 | 35b4a22b8c |
15 | 1c7e4cb7e0 |
hex | 106d89a9b8 |
70557215160 has 128 divisors (see below), whose sum is σ = 222916147200. Its totient is φ = 17816670720.
The previous prime is 70557215159. The next prime is 70557215203. The reversal of 70557215160 is 6151275507.
It is a super-2 number, since 2×705572151602 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5969977 + ... + 5981783.
It is an arithmetic number, because the mean of its divisors is an integer number (1741532400).
Almost surely, 270557215160 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 70557215160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111458073600).
70557215160 is an abundant number, since it is smaller than the sum of its proper divisors (152358932040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70557215160 is a wasteful number, since it uses less digits than its factorization.
70557215160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14461 (or 14457 counting only the distinct ones).
The product of its (nonzero) digits is 73500, while the sum is 39.
The spelling of 70557215160 in words is "seventy billion, five hundred fifty-seven million, two hundred fifteen thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •