Base | Representation |
---|---|
bin | 1101110001001… |
… | …10011110111101 |
3 | 22001100001120102 |
4 | 12320212132331 |
5 | 214032012424 |
6 | 15243330445 |
7 | 2601512402 |
oct | 670463675 |
9 | 261301512 |
10 | 115500989 |
11 | 5a21966a |
12 | 32820a25 |
13 | 1ac101a6 |
14 | 114a82a9 |
15 | a2177ae |
hex | 6e267bd |
115500989 has 2 divisors, whose sum is σ = 115500990. Its totient is φ = 115500988.
The previous prime is 115500971. The next prime is 115500991. The reversal of 115500989 is 989005511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113784889 + 1716100 = 10667^2 + 1310^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115500989 is a prime.
Together with 115500991, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115503989) 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, 57750494 + 57750495.
It is an arithmetic number, because the mean of its divisors is an integer number (57750495).
Almost surely, 2115500989 is an apocalyptic number.
It is an amenable number.
115500989 is a deficient number, since it is larger than the sum of its proper divisors (1).
115500989 is an equidigital number, since it uses as much as digits as its factorization.
115500989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 38.
The square root of 115500989 is about 10747.1386424480. The cubic root of 115500989 is about 486.9995586828. Note that the first 3 decimals are identical.
The spelling of 115500989 in words is "one hundred fifteen million, five hundred thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •