Base | Representation |
---|---|
bin | 11010011111011110011001… |
… | …010101010101100000101101 |
3 | 120021112110020002022120020020 |
4 | 122133132121111111200231 |
5 | 110232413340442031043 |
6 | 1051444535402112353 |
7 | 33353503462244130 |
oct | 3237363125254055 |
9 | 507473202276206 |
10 | 116512150345773 |
11 | 3414058644a716 |
12 | 11098a034ab6b9 |
13 | 5002082b03c20 |
14 | 20ab30a90a217 |
15 | d70b35d4ae83 |
hex | 69f79955582d |
116512150345773 has 32 divisors (see below), whose sum is σ = 191200363339776. Its totient is φ = 61456657203648.
The previous prime is 116512150345729. The next prime is 116512150345793. The reversal of 116512150345773 is 377543051215611.
It is not a de Polignac number, because 116512150345773 - 225 = 116512116791341 is a prime.
It is a super-2 number, since 2×1165121503457732 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116512150345793) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61619236 + ... + 63481922.
It is an arithmetic number, because the mean of its divisors is an integer number (5975011354368).
Almost surely, 2116512150345773 is an apocalyptic number.
116512150345773 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
116512150345773 is a deficient number, since it is larger than the sum of its proper divisors (74688212994003).
116512150345773 is a wasteful number, since it uses less digits than its factorization.
116512150345773 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2091833.
The product of its (nonzero) digits is 2646000, while the sum is 51.
The spelling of 116512150345773 in words is "one hundred sixteen trillion, five hundred twelve billion, one hundred fifty million, three hundred forty-five thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •