Base | Representation |
---|---|
bin | 110110011001001110… |
… | …1000000000001001101 |
3 | 102011111201201021211110 |
4 | 1230302131000001031 |
5 | 3403212002030140 |
6 | 125355000042233 |
7 | 11303450355645 |
oct | 1546235000115 |
9 | 364451637743 |
10 | 116810580045 |
11 | 455a2588765 |
12 | 1a77b763379 |
13 | b0274b1423 |
14 | 5921913525 |
15 | 3089e97380 |
hex | 1b3274004d |
116810580045 has 16 divisors (see below), whose sum is σ = 187977261312. Its totient is φ = 61938864960.
The previous prime is 116810580041. The next prime is 116810580053. The reversal of 116810580045 is 540085018611.
It is not a de Polignac number, because 116810580045 - 22 = 116810580041 is a prime.
It is a super-2 number, since 2×1168105800452 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 116810579985 and 116810580012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116810580041) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22504261 + ... + 22509450.
It is an arithmetic number, because the mean of its divisors is an integer number (11748578832).
Almost surely, 2116810580045 is an apocalyptic number.
116810580045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116810580045 is a deficient number, since it is larger than the sum of its proper divisors (71166681267).
116810580045 is a wasteful number, since it uses less digits than its factorization.
116810580045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45013892.
The product of its (nonzero) digits is 38400, while the sum is 39.
Adding to 116810580045 its reverse (540085018611), we get a palindrome (656895598656).
The spelling of 116810580045 in words is "one hundred sixteen billion, eight hundred ten million, five hundred eighty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •