Base | Representation |
---|---|
bin | 110110001010001100… |
… | …1110101110010100101 |
3 | 102010012121002002011112 |
4 | 1230110121311302211 |
5 | 3401143421411422 |
6 | 125232550314405 |
7 | 11255116250006 |
oct | 1542431656245 |
9 | 363177062145 |
10 | 116306435237 |
11 | 45363a50263 |
12 | 1a65a958a05 |
13 | ac76c078a5 |
14 | 58b499d1ad |
15 | 305aab0ee2 |
hex | 1b14675ca5 |
116306435237 has 2 divisors, whose sum is σ = 116306435238. Its totient is φ = 116306435236.
The previous prime is 116306435233. The next prime is 116306435239. The reversal of 116306435237 is 732534603611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107842619236 + 8463816001 = 328394^2 + 91999^2 .
It is a cyclic number.
It is not a de Polignac number, because 116306435237 - 22 = 116306435233 is a prime.
Together with 116306435239, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 116306435194 and 116306435203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (116306435233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 58153217618 + 58153217619.
It is an arithmetic number, because the mean of its divisors is an integer number (58153217619).
Almost surely, 2116306435237 is an apocalyptic number.
It is an amenable number.
116306435237 is a deficient number, since it is larger than the sum of its proper divisors (1).
116306435237 is an equidigital number, since it uses as much as digits as its factorization.
116306435237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 41.
The spelling of 116306435237 in words is "one hundred sixteen billion, three hundred six million, four hundred thirty-five thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •