Base | Representation |
---|---|
bin | 11011011001111110… |
… | …10011011111101001 |
3 | 1101222101220222222011 |
4 | 31230333103133221 |
5 | 220113114424022 |
6 | 10431555555521 |
7 | 1030420100161 |
oct | 155477233751 |
9 | 41871828864 |
10 | 14713436137 |
11 | 6270395384 |
12 | 2a275bbba1 |
13 | 1506373b3a |
14 | 9d814b5a1 |
15 | 5b1aab977 |
hex | 36cfd37e9 |
14713436137 has 2 divisors, whose sum is σ = 14713436138. Its totient is φ = 14713436136.
The previous prime is 14713436117. The next prime is 14713436141. The reversal of 14713436137 is 73163431741.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8894187481 + 5819248656 = 94309^2 + 76284^2 .
It is an emirp because it is prime and its reverse (73163431741) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14713436137 - 219 = 14712911849 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14713436137.
It is not a weakly prime, because it can be changed into another prime (14713436117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7356718068 + 7356718069.
It is an arithmetic number, because the mean of its divisors is an integer number (7356718069).
Almost surely, 214713436137 is an apocalyptic number.
It is an amenable number.
14713436137 is a deficient number, since it is larger than the sum of its proper divisors (1).
14713436137 is an equidigital number, since it uses as much as digits as its factorization.
14713436137 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 127008, while the sum is 40.
Adding to 14713436137 its reverse (73163431741), we get a palindrome (87876867878).
The spelling of 14713436137 in words is "fourteen billion, seven hundred thirteen million, four hundred thirty-six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •