Base | Representation |
---|---|
bin | 100000101010100010… |
… | …1000100100100111010 |
3 | 20201001122201012001000 |
4 | 1001111011010210322 |
5 | 2122130044311222 |
6 | 52120334505430 |
7 | 5032206360540 |
oct | 1012505044472 |
9 | 221048635030 |
10 | 70146869562 |
11 | 27827096380 |
12 | 11718065276 |
13 | 67cb9bb713 |
14 | 3576327d90 |
15 | 1c584729ac |
hex | 105514493a |
70146869562 has 192 divisors, whose sum is σ = 203169899520. Its totient is φ = 17427247200.
The previous prime is 70146869509. The next prime is 70146869621. The reversal of 70146869562 is 26596864107.
70146869562 is a `hidden beast` number, since 7 + 0 + 14 + 6 + 8 + 69 + 562 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a junction number, because it is equal to n+sod(n) for n = 70146869499 and 70146869508.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2183637 + ... + 2215527.
It is an arithmetic number, because the mean of its divisors is an integer number (1058176560).
Almost surely, 270146869562 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70146869562, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101584949760).
70146869562 is an abundant number, since it is smaller than the sum of its proper divisors (133023029958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70146869562 is a wasteful number, since it uses less digits than its factorization.
70146869562 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31966 (or 31937 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 54.
The spelling of 70146869562 in words is "seventy billion, one hundred forty-six million, eight hundred sixty-nine thousand, five hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •