Base | Representation |
---|---|
bin | 110110000010100100… |
… | …1100010111100111011 |
3 | 102002112202111111121112 |
4 | 1230011021202330323 |
5 | 3400132412134111 |
6 | 125151325030535 |
7 | 11245561010162 |
oct | 1540511427473 |
9 | 362482444545 |
10 | 116050505531 |
11 | 45242537504 |
12 | 1a5a90b544b |
13 | ac35b9a1ac |
14 | 588c9bc3d9 |
15 | 30433a9e8b |
hex | 1b05262f3b |
116050505531 has 2 divisors, whose sum is σ = 116050505532. Its totient is φ = 116050505530.
The previous prime is 116050505449. The next prime is 116050505603. The reversal of 116050505531 is 135505050611.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 116050505531 - 214 = 116050489147 is a prime.
It is a super-2 number, since 2×1160505055312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (116050585531) 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 as a sum of consecutive naturals, namely, 58025252765 + 58025252766.
It is an arithmetic number, because the mean of its divisors is an integer number (58025252766).
Almost surely, 2116050505531 is an apocalyptic number.
116050505531 is a deficient number, since it is larger than the sum of its proper divisors (1).
116050505531 is an equidigital number, since it uses as much as digits as its factorization.
116050505531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11250, while the sum is 32.
The spelling of 116050505531 in words is "one hundred sixteen billion, fifty million, five hundred five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •