Base | Representation |
---|---|
bin | 1101111011110… |
… | …01101011001001 |
3 | 22010221122100212 |
4 | 12331321223021 |
5 | 214410442223 |
6 | 15333210505 |
7 | 2616360041 |
oct | 675715311 |
9 | 263848325 |
10 | 116890313 |
11 | 5aa88471 |
12 | 33190a35 |
13 | 1b2a8687 |
14 | 1174a721 |
15 | a3de278 |
hex | 6f79ac9 |
116890313 has 2 divisors, whose sum is σ = 116890314. Its totient is φ = 116890312.
The previous prime is 116890309. The next prime is 116890321. The reversal of 116890313 is 313098611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 114661264 + 2229049 = 10708^2 + 1493^2 .
It is a cyclic number.
It is not a de Polignac number, because 116890313 - 22 = 116890309 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 116890313.
It is not a weakly prime, because it can be changed into another prime (116890373) 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, 58445156 + 58445157.
It is an arithmetic number, because the mean of its divisors is an integer number (58445157).
Almost surely, 2116890313 is an apocalyptic number.
It is an amenable number.
116890313 is a deficient number, since it is larger than the sum of its proper divisors (1).
116890313 is an equidigital number, since it uses as much as digits as its factorization.
116890313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 32.
The square root of 116890313 is about 10811.5823541237. The cubic root of 116890313 is about 488.9444346458.
The spelling of 116890313 in words is "one hundred sixteen million, eight hundred ninety thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.182 sec. • engine limits •