Base | Representation |
---|---|
bin | 110110000010100100… |
… | …1100010111101011101 |
3 | 102002112202111111122210 |
4 | 1230011021202331131 |
5 | 3400132412134230 |
6 | 125151325031033 |
7 | 11245561010241 |
oct | 1540511427535 |
9 | 362482444583 |
10 | 116050505565 |
11 | 45242537535 |
12 | 1a5a90b5479 |
13 | ac35b9a207 |
14 | 588c9bc421 |
15 | 30433a9eb0 |
hex | 1b05262f5d |
116050505565 has 32 divisors (see below), whose sum is σ = 193778645760. Its totient is φ = 59195012096.
The previous prime is 116050505531. The next prime is 116050505603. The reversal of 116050505565 is 565505050611.
It is a cyclic number.
It is not a de Polignac number, because 116050505565 - 27 = 116050505437 is a prime.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 3533359 + ... + 3566051.
It is an arithmetic number, because the mean of its divisors is an integer number (6055582680).
Almost surely, 2116050505565 is an apocalyptic number.
116050505565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116050505565 is a deficient number, since it is larger than the sum of its proper divisors (77728140195).
116050505565 is a wasteful number, since it uses less digits than its factorization.
116050505565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43013.
The product of its (nonzero) digits is 112500, while the sum is 39.
The spelling of 116050505565 in words is "one hundred sixteen billion, fifty million, five hundred five thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •