Base | Representation |
---|---|
bin | 11011000010100011… |
… | …00110010011000101 |
3 | 1101110201010012010222 |
4 | 31201101212103011 |
5 | 214212311431112 |
6 | 10400255354125 |
7 | 1022512441436 |
oct | 154121462305 |
9 | 41421105128 |
10 | 14516905157 |
11 | 617a461787 |
12 | 2991822945 |
13 | 14a4732811 |
14 | 9b9dcd48d |
15 | 59e6da372 |
hex | 3614664c5 |
14516905157 has 2 divisors, whose sum is σ = 14516905158. Its totient is φ = 14516905156.
The previous prime is 14516905133. The next prime is 14516905159. The reversal of 14516905157 is 75150961541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13215571681 + 1301333476 = 114959^2 + 36074^2 .
It is a cyclic number.
It is not a de Polignac number, because 14516905157 - 28 = 14516904901 is a prime.
Together with 14516905159, 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 (14516905159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7258452578 + 7258452579.
It is an arithmetic number, because the mean of its divisors is an integer number (7258452579).
Almost surely, 214516905157 is an apocalyptic number.
It is an amenable number.
14516905157 is a deficient number, since it is larger than the sum of its proper divisors (1).
14516905157 is an equidigital number, since it uses as much as digits as its factorization.
14516905157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 189000, while the sum is 44.
The spelling of 14516905157 in words is "fourteen billion, five hundred sixteen million, nine hundred five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •