Base | Representation |
---|---|
bin | 100000101110010101… |
… | …1101110111000111000 |
3 | 20201101112202200102220 |
4 | 1001130223232320320 |
5 | 2122410224213411 |
6 | 52141133124040 |
7 | 5035315632300 |
oct | 1013453567070 |
9 | 221345680386 |
10 | 70274444856 |
11 | 27892101600 |
12 | 11752929620 |
13 | 681c268665 |
14 | 3589256600 |
15 | 1c64772b06 |
hex | 105caeee38 |
70274444856 has 576 divisors, whose sum is σ = 235799424000. Its totient is φ = 17368243200.
The previous prime is 70274444827. The next prime is 70274444873. The reversal of 70274444856 is 65844447207.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 70274444799 and 70274444808.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 392594575 + ... + 392594753.
It is an arithmetic number, because the mean of its divisors is an integer number (409374000).
Almost surely, 270274444856 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 70274444856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117899712000).
70274444856 is an abundant number, since it is smaller than the sum of its proper divisors (165524979144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70274444856 is a wasteful number, since it uses less digits than its factorization.
70274444856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344 (or 322 counting only the distinct ones).
The product of its (nonzero) digits is 6021120, while the sum is 51.
The spelling of 70274444856 in words is "seventy billion, two hundred seventy-four million, four hundred forty-four thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •