Base | Representation |
---|---|
bin | 11011001000000100… |
… | …00000010011011011 |
3 | 1101120221010121210121 |
4 | 31210002000103123 |
5 | 214311131232034 |
6 | 10405030454111 |
7 | 1023613503256 |
oct | 154402002333 |
9 | 41527117717 |
10 | 14563149019 |
11 | 61a3577451 |
12 | 29a5204337 |
13 | 14b11a4353 |
14 | 9c21ca09d |
15 | 5a37c21b4 |
hex | 3640804db |
14563149019 has 2 divisors, whose sum is σ = 14563149020. Its totient is φ = 14563149018.
The previous prime is 14563149017. The next prime is 14563149043. The reversal of 14563149019 is 91094136541.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14563149019 - 21 = 14563149017 is a prime.
It is a super-2 number, since 2×145631490192 (a number of 21 digits) contains 22 as substring.
Together with 14563149017, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (14563149017) 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, 7281574509 + 7281574510.
It is an arithmetic number, because the mean of its divisors is an integer number (7281574510).
Almost surely, 214563149019 is an apocalyptic number.
14563149019 is a deficient number, since it is larger than the sum of its proper divisors (1).
14563149019 is an equidigital number, since it uses as much as digits as its factorization.
14563149019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 116640, while the sum is 43.
The spelling of 14563149019 in words is "fourteen billion, five hundred sixty-three million, one hundred forty-nine thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •