Base | Representation |
---|---|
bin | 11010100001011000011100… |
… | …110001100000100111111011 |
3 | 120021222222111110221201110002 |
4 | 122201120130301200213323 |
5 | 110242040240332043444 |
6 | 1052025052020543215 |
7 | 33366123226603313 |
oct | 3241303461404773 |
9 | 507888443851402 |
10 | 116643204565499 |
11 | 34191118105717 |
12 | 110ba299251b0b |
13 | 501153a21a8c1 |
14 | 20b37bddd8443 |
15 | d74256500d4e |
hex | 6a161cc609fb |
116643204565499 has 2 divisors, whose sum is σ = 116643204565500. Its totient is φ = 116643204565498.
The previous prime is 116643204565399. The next prime is 116643204565501. The reversal of 116643204565499 is 994565402346611.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 116643204565499 - 216 = 116643204499963 is a prime.
It is a super-2 number, since 2×1166432045654992 (a number of 29 digits) contains 22 as substring.
Together with 116643204565501, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (116643204565399) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58321602282749 + 58321602282750.
It is an arithmetic number, because the mean of its divisors is an integer number (58321602282750).
Almost surely, 2116643204565499 is an apocalyptic number.
116643204565499 is a deficient number, since it is larger than the sum of its proper divisors (1).
116643204565499 is an equidigital number, since it uses as much as digits as its factorization.
116643204565499 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 167961600, while the sum is 65.
The spelling of 116643204565499 in words is "one hundred sixteen trillion, six hundred forty-three billion, two hundred four million, five hundred sixty-five thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •