Base | Representation |
---|---|
bin | 100000111000011000… |
… | …1111001011010010000 |
3 | 20202021001012012101200 |
4 | 1001300301321122100 |
5 | 2124103032331021 |
6 | 52234415431200 |
7 | 5046551512002 |
oct | 1016061713220 |
9 | 222231165350 |
10 | 70611605136 |
11 | 27a45457066 |
12 | 11827825500 |
13 | 6874077597 |
14 | 35bbd40372 |
15 | 1c84172126 |
hex | 1070c79690 |
70611605136 has 120 divisors (see below), whose sum is σ = 203020193376. Its totient is φ = 22897728000.
The previous prime is 70611605089. The next prime is 70611605137. The reversal of 70611605136 is 63150611607.
70611605136 is a `hidden beast` number, since 7 + 0 + 6 + 11 + 605 + 1 + 36 = 666.
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 70611605136.
It is not an unprimeable number, because it can be changed into a prime (70611605137) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1531476 + ... + 1576908.
Almost surely, 270611605136 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 70611605136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101510096688).
70611605136 is an abundant number, since it is smaller than the sum of its proper divisors (132408588240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70611605136 is a wasteful number, since it uses less digits than its factorization.
70611605136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45741 (or 45732 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The spelling of 70611605136 in words is "seventy billion, six hundred eleven million, six hundred five thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •