Base | Representation |
---|---|
bin | 100001000001010110… |
… | …0110110110011001000 |
3 | 20210000222221202000000 |
4 | 1002002230312303020 |
5 | 2130212020223413 |
6 | 52324320043000 |
7 | 5060162244321 |
oct | 1020254666310 |
9 | 223028852000 |
10 | 70912273608 |
11 | 2808a147800 |
12 | 118b0463460 |
13 | 68c144a717 |
14 | 3609c49448 |
15 | 1ca0764073 |
hex | 1082b36cc8 |
70912273608 has 252 divisors, whose sum is σ = 219813191745. Its totient is φ = 21420780480.
The previous prime is 70912273589. The next prime is 70912273639. The reversal of 70912273608 is 80637221907.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
70912273608 is a `hidden beast` number, since 7 + 0 + 9 + 12 + 27 + 3 + 608 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 51757160004 + 19155113604 = 227502^2 + 138402^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=188298.
It is an unprimeable number.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 223697866 + ... + 223698182.
Almost surely, 270912273608 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 70912273608
70912273608 is an abundant number, since it is smaller than the sum of its proper divisors (148900918137).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70912273608 is an equidigital number, since it uses as much as digits as its factorization.
70912273608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 680 (or 333 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 45.
The spelling of 70912273608 in words is "seventy billion, nine hundred twelve million, two hundred seventy-three thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •