Base | Representation |
---|---|
bin | 10000010001101110001110… |
… | …011111011100011100011000 |
3 | 100101110121112222020201000020 |
4 | 100101232032133130130120 |
5 | 33340333334243430242 |
6 | 412130233533310440 |
7 | 21035650641435441 |
oct | 2021561637343430 |
9 | 311417488221006 |
10 | 71586610530072 |
11 | 2089a790426690 |
12 | 8041b6b035420 |
13 | 30c3785965671 |
14 | 1396b4bba42c8 |
15 | 8421ea8946ec |
hex | 411b8e7dc718 |
71586610530072 has 128 divisors (see below), whose sum is σ = 205516512230400. Its totient is φ = 20550708892800.
The previous prime is 71586610530047. The next prime is 71586610530073. The reversal of 71586610530072 is 27003501668517.
It is a junction number, because it is equal to n+sod(n) for n = 71586610529997 and 71586610530024.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71586610530073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 259826547 + ... + 260101917.
It is an arithmetic number, because the mean of its divisors is an integer number (1605597751800).
Almost surely, 271586610530072 is an apocalyptic number.
It is an amenable number.
71586610530072 is an abundant number, since it is smaller than the sum of its proper divisors (133929901700328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71586610530072 is a wasteful number, since it uses less digits than its factorization.
71586610530072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327237 (or 327233 counting only the distinct ones).
The product of its (nonzero) digits is 2116800, while the sum is 51.
The spelling of 71586610530072 in words is "seventy-one trillion, five hundred eighty-six billion, six hundred ten million, five hundred thirty thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •