Base | Representation |
---|---|
bin | 1101111001001… |
… | …11000001001001 |
3 | 22010022102221121 |
4 | 12330213001021 |
5 | 214314124003 |
6 | 15322035241 |
7 | 2613450013 |
oct | 674470111 |
9 | 263272847 |
10 | 116551753 |
11 | 5a87706a |
12 | 33048b21 |
13 | 1b1ba546 |
14 | 1169d1b3 |
15 | a373cbd |
hex | 6f27049 |
116551753 has 2 divisors, whose sum is σ = 116551754. Its totient is φ = 116551752.
The previous prime is 116551751. The next prime is 116551759. The reversal of 116551753 is 357155611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115175824 + 1375929 = 10732^2 + 1173^2 .
It is a cyclic number.
It is not a de Polignac number, because 116551753 - 21 = 116551751 is a prime.
It is a super-2 number, since 2×1165517532 = 27168622254746018, which contains 22 as substring.
Together with 116551751, it forms a pair of twin primes.
It is equal to p6656362 and since 116551753 and 6656362 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (116551751) 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, 58275876 + 58275877.
It is an arithmetic number, because the mean of its divisors is an integer number (58275877).
Almost surely, 2116551753 is an apocalyptic number.
It is an amenable number.
116551753 is a deficient number, since it is larger than the sum of its proper divisors (1).
116551753 is an equidigital number, since it uses as much as digits as its factorization.
116551753 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 15750, while the sum is 34.
The square root of 116551753 is about 10795.9137176989. The cubic root of 116551753 is about 488.4719201400.
The spelling of 116551753 in words is "one hundred sixteen million, five hundred fifty-one thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •