Base | Representation |
---|---|
bin | 10000010100100111100001… |
… | …100111100001011001100000 |
3 | 100102011122010001110112021110 |
4 | 100110213201213201121200 |
5 | 33402113323323331224 |
6 | 412401500503423320 |
7 | 21056223302165466 |
oct | 2024474147413140 |
9 | 312148101415243 |
10 | 71785573652064 |
11 | 209670aa976008 |
12 | 8074637454b40 |
13 | 3109473204b4c |
14 | 13a2624298836 |
15 | 847492ca0929 |
hex | 4149e19e1660 |
71785573652064 has 48 divisors (see below), whose sum is σ = 191992548413232. Its totient is φ = 23477042953728.
The previous prime is 71785573652057. The next prime is 71785573652083. The reversal of 71785573652064 is 46025637558717.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 71785573651986 and 71785573652004.
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 7 ways as a sum of consecutive naturals, for example, 7054394839 + ... + 7054405014.
It is an arithmetic number, because the mean of its divisors is an integer number (3999844758609).
Almost surely, 271785573652064 is an apocalyptic number.
It is an amenable number.
71785573652064 is an abundant number, since it is smaller than the sum of its proper divisors (120206974761168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71785573652064 is a wasteful number, since it uses less digits than its factorization.
71785573652064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14108799919 (or 14108799911 counting only the distinct ones).
The product of its (nonzero) digits is 296352000, while the sum is 66.
The spelling of 71785573652064 in words is "seventy-one trillion, seven hundred eighty-five billion, five hundred seventy-three million, six hundred fifty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •