Base | Representation |
---|---|
bin | 1101111000111… |
… | …01110101110001 |
3 | 22010020112101022 |
4 | 12330131311301 |
5 | 214311423121 |
6 | 15321145225 |
7 | 2613232301 |
oct | 674356561 |
9 | 263215338 |
10 | 116514161 |
11 | 5a8508a5 |
12 | 3302b215 |
13 | 1b1a63ba |
14 | 1168d601 |
15 | a367aab |
hex | 6f1dd71 |
116514161 has 2 divisors, whose sum is σ = 116514162. Its totient is φ = 116514160.
The previous prime is 116514157. The next prime is 116514163. The reversal of 116514161 is 161415611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111429136 + 5085025 = 10556^2 + 2255^2 .
It is a cyclic number.
It is not a de Polignac number, because 116514161 - 22 = 116514157 is a prime.
Together with 116514163, it forms a pair of twin primes.
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 116514161.
It is not a weakly prime, because it can be changed into another prime (116514163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58257080 + 58257081.
It is an arithmetic number, because the mean of its divisors is an integer number (58257081).
Almost surely, 2116514161 is an apocalyptic number.
It is an amenable number.
116514161 is a deficient number, since it is larger than the sum of its proper divisors (1).
116514161 is an equidigital number, since it uses as much as digits as its factorization.
116514161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 720, while the sum is 26.
The square root of 116514161 is about 10794.1725481854. The cubic root of 116514161 is about 488.4193980901.
Adding to 116514161 its reverse (161415611), we get a palindrome (277929772).
The spelling of 116514161 in words is "one hundred sixteen million, five hundred fourteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •