Base | Representation |
---|---|
bin | 11010100000010110000001… |
… | …000001100110110101000000 |
3 | 120021202011101012021010111002 |
4 | 122200112001001212311000 |
5 | 110234403143222002114 |
6 | 1051532213445511132 |
7 | 33361016442412145 |
oct | 3240260101466500 |
9 | 507664335233432 |
10 | 116571872062784 |
11 | 34163942836636 |
12 | 110a84b01124a8 |
13 | 50078ac9c8108 |
14 | 20b01744403cc |
15 | d7247de2e7de |
hex | 6a0581066d40 |
116571872062784 has 28 divisors (see below), whose sum is σ = 237574262916564. Its totient is φ = 56710640461824.
The previous prime is 116571872062757. The next prime is 116571872062819. The reversal of 116571872062784 is 487260278175611.
It can be written as a sum of positive squares in 2 ways, for example, as 100619516541184 + 15952355521600 = 10030928^2 + 3994040^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 116571872062784.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24613990889 + ... + 24613995624.
It is an arithmetic number, because the mean of its divisors is an integer number (8484795104163).
Almost surely, 2116571872062784 is an apocalyptic number.
It is an amenable number.
116571872062784 is an abundant number, since it is smaller than the sum of its proper divisors (121002390853780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116571872062784 is an equidigital number, since it uses as much as digits as its factorization.
116571872062784 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49227986562 (or 49227986552 counting only the distinct ones).
The product of its (nonzero) digits is 63221760, while the sum is 65.
The spelling of 116571872062784 in words is "one hundred sixteen trillion, five hundred seventy-one billion, eight hundred seventy-two million, sixty-two thousand, seven hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.999 sec. • engine limits •