Base | Representation |
---|---|
bin | 1101110101100… |
… | …11000000001101 |
3 | 22002102022002202 |
4 | 12322303000031 |
5 | 214203422212 |
6 | 15303531245 |
7 | 2606430422 |
oct | 672630015 |
9 | 262368082 |
10 | 116076557 |
11 | 5a582043 |
12 | 32a59b25 |
13 | 1b08216c |
14 | 115b7d49 |
15 | a2cd0c2 |
hex | 6eb300d |
116076557 has 2 divisors, whose sum is σ = 116076558. Its totient is φ = 116076556.
The previous prime is 116076553. The next prime is 116076563. The reversal of 116076557 is 755670611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 87067561 + 29008996 = 9331^2 + 5386^2 .
It is an emirp because it is prime and its reverse (755670611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 116076557 - 22 = 116076553 is a prime.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 116076557.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116076553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58038278 + 58038279.
It is an arithmetic number, because the mean of its divisors is an integer number (58038279).
Almost surely, 2116076557 is an apocalyptic number.
It is an amenable number.
116076557 is a deficient number, since it is larger than the sum of its proper divisors (1).
116076557 is an equidigital number, since it uses as much as digits as its factorization.
116076557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 44100, while the sum is 38.
The square root of 116076557 is about 10773.8830975651. The cubic root of 116076557 is about 487.8071622860.
The spelling of 116076557 in words is "one hundred sixteen million, seventy-six thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •