Base | Representation |
---|---|
bin | 110110000011101111… |
… | …1111000001001100111 |
3 | 102002122111122122210221 |
4 | 1230013133320021213 |
5 | 3400223004221314 |
6 | 125155253425211 |
7 | 11246546662435 |
oct | 1540737701147 |
9 | 362574578727 |
10 | 116089913959 |
11 | 45262803658 |
12 | 1a5ba33b207 |
13 | ac410b76a6 |
14 | 5893d19d55 |
15 | 3046a91824 |
hex | 1b077f8267 |
116089913959 has 2 divisors, whose sum is σ = 116089913960. Its totient is φ = 116089913958.
The previous prime is 116089913957. The next prime is 116089913977. The reversal of 116089913959 is 959319980611.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 116089913959 - 21 = 116089913957 is a prime.
Together with 116089913957, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 116089913897 and 116089913906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116089913957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58044956979 + 58044956980.
It is an arithmetic number, because the mean of its divisors is an integer number (58044956980).
Almost surely, 2116089913959 is an apocalyptic number.
116089913959 is a deficient number, since it is larger than the sum of its proper divisors (1).
116089913959 is an equidigital number, since it uses as much as digits as its factorization.
116089913959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4723920, while the sum is 61.
The spelling of 116089913959 in words is "one hundred sixteen billion, eighty-nine million, nine hundred thirteen thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •