Base | Representation |
---|---|
bin | 1101111000010… |
… | …00010111100001 |
3 | 22010002001201211 |
4 | 12330020113201 |
5 | 214301114314 |
6 | 15315230121 |
7 | 2612415004 |
oct | 674102741 |
9 | 263061654 |
10 | 116426209 |
11 | 5a7a0809 |
12 | 32ba8341 |
13 | 1b175363 |
14 | 1166953b |
15 | a34b9c4 |
hex | 6f085e1 |
116426209 has 2 divisors, whose sum is σ = 116426210. Its totient is φ = 116426208.
The previous prime is 116426203. The next prime is 116426249. The reversal of 116426209 is 902624611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107184609 + 9241600 = 10353^2 + 3040^2 .
It is a cyclic number.
It is not a de Polignac number, because 116426209 - 23 = 116426201 is a prime.
It is a super-2 number, since 2×1164262092 = 27110124284223362, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (116426201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58213104 + 58213105.
It is an arithmetic number, because the mean of its divisors is an integer number (58213105).
Almost surely, 2116426209 is an apocalyptic number.
It is an amenable number.
116426209 is a deficient number, since it is larger than the sum of its proper divisors (1).
116426209 is an equidigital number, since it uses as much as digits as its factorization.
116426209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 116426209 is about 10790.0977289365. The cubic root of 116426209 is about 488.2964708967.
The spelling of 116426209 in words is "one hundred sixteen million, four hundred twenty-six thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •