Base | Representation |
---|---|
bin | 10000001010110101101101… |
… | …010010010000000011000100 |
3 | 100022210101122112200210220110 |
4 | 100022311231102100003010 |
5 | 33310111131344130430 |
6 | 411125050130433020 |
7 | 20656534322105004 |
oct | 2012655522200304 |
9 | 308711575623813 |
10 | 71113607020740 |
11 | 207281252651a9 |
12 | 7b86363132770 |
13 | 308aca486a02b |
14 | 137bcba14c004 |
15 | 834c64d517b0 |
hex | 40ad6d4900c4 |
71113607020740 has 48 divisors (see below), whose sum is σ = 199593321923520. Its totient is φ = 18918369275520.
The previous prime is 71113607020727. The next prime is 71113607020837. The reversal of 71113607020740 is 4702070631117.
71113607020740 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1414326631 + ... + 1414376910.
It is an arithmetic number, because the mean of its divisors is an integer number (4158194206740).
Almost surely, 271113607020740 is an apocalyptic number.
It is an amenable number.
71113607020740 is an abundant number, since it is smaller than the sum of its proper divisors (128479714902780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71113607020740 is a wasteful number, since it uses less digits than its factorization.
71113607020740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2828703972 (or 2828703970 counting only the distinct ones).
The product of its (nonzero) digits is 49392, while the sum is 39.
Adding to 71113607020740 its reverse (4702070631117), we get a palindrome (75815677651857).
The spelling of 71113607020740 in words is "seventy-one trillion, one hundred thirteen billion, six hundred seven million, twenty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •