Base | Representation |
---|---|
bin | 1010001000000110… |
… | …00001001001011111 |
3 | 112000212221100200022 |
4 | 11010003001021133 |
5 | 42113232442434 |
6 | 2255245222355 |
7 | 251503262234 |
oct | 50403011137 |
9 | 15025840608 |
10 | 5436609119 |
11 | 233a907997 |
12 | 10788619bb |
13 | 68844a496 |
14 | 39807578b |
15 | 21c44c22e |
hex | 1440c125f |
5436609119 has 2 divisors, whose sum is σ = 5436609120. Its totient is φ = 5436609118.
The previous prime is 5436609053. The next prime is 5436609121. The reversal of 5436609119 is 9119066345.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5436609119 is a prime.
It is a super-2 number, since 2×54366091192 = 59113437425587912322, which contains 22 as substring.
Together with 5436609121, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5436609119.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5436609179) 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, 2718304559 + 2718304560.
It is an arithmetic number, because the mean of its divisors is an integer number (2718304560).
Almost surely, 25436609119 is an apocalyptic number.
5436609119 is a deficient number, since it is larger than the sum of its proper divisors (1).
5436609119 is an equidigital number, since it uses as much as digits as its factorization.
5436609119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 44.
The square root of 5436609119 is about 73733.3650323922. The cubic root of 5436609119 is about 1758.3663731523.
The spelling of 5436609119 in words is "five billion, four hundred thirty-six million, six hundred nine thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •