Base | Representation |
---|---|
bin | 110110001101010011… |
… | …0101110101001101000 |
3 | 102010110211211221212002 |
4 | 1230122212232221220 |
5 | 3401402040232120 |
6 | 125251144310132 |
7 | 11260521505145 |
oct | 1543246565150 |
9 | 363424757762 |
10 | 116410477160 |
11 | 4540775251a |
12 | 1a689772348 |
13 | ac92635063 |
14 | 58c47233cc |
15 | 3064cb3375 |
hex | 1b1a9aea68 |
116410477160 has 48 divisors (see below), whose sum is σ = 262761510060. Its totient is φ = 46415697920.
The previous prime is 116410477151. The next prime is 116410477163. The reversal of 116410477160 is 61774014611.
It can be written as a sum of positive squares in 6 ways, for example, as 21372685636 + 95037791524 = 146194^2 + 308282^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116410477163) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 4005080 + ... + 4034040.
Almost surely, 2116410477160 is an apocalyptic number.
116410477160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
116410477160 is an abundant number, since it is smaller than the sum of its proper divisors (146351032900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116410477160 is an equidigital number, since it uses as much as digits as its factorization.
116410477160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29606 (or 29285 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 38.
The spelling of 116410477160 in words is "one hundred sixteen billion, four hundred ten million, four hundred seventy-seven thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •