Base | Representation |
---|---|
bin | 100001000000000010… |
… | …0010001001011111000 |
3 | 20202220220210102212201 |
4 | 1002000010101023320 |
5 | 2130114212014402 |
6 | 52320100515544 |
7 | 5056114510150 |
oct | 1020004211370 |
9 | 222826712781 |
10 | 70868079352 |
11 | 28067201a24 |
12 | 118996abbb4 |
13 | 68b5245a85 |
14 | 3604023760 |
15 | 1c9b934687 |
hex | 10801112f8 |
70868079352 has 128 divisors (see below), whose sum is σ = 158090567040. Its totient is φ = 29150668800.
The previous prime is 70868079349. The next prime is 70868079361. The reversal of 70868079352 is 25397086807.
It is a junction number, because it is equal to n+sod(n) for n = 70868079293 and 70868079302.
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 31 ways as a sum of consecutive naturals, for example, 83080558 + ... + 83081410.
It is an arithmetic number, because the mean of its divisors is an integer number (1235082555).
Almost surely, 270868079352 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 70868079352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (79045283520).
70868079352 is an abundant number, since it is smaller than the sum of its proper divisors (87222487688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70868079352 is a wasteful number, since it uses less digits than its factorization.
70868079352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1401 (or 1397 counting only the distinct ones).
The product of its (nonzero) digits is 5080320, while the sum is 55.
The spelling of 70868079352 in words is "seventy billion, eight hundred sixty-eight million, seventy-nine thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •