Base | Representation |
---|---|
bin | 11010110011011111… |
… | …11100001101101111 |
3 | 1101010220112022222221 |
4 | 31121233330031233 |
5 | 213433001012034 |
6 | 10335545220211 |
7 | 1016420302042 |
oct | 153157741557 |
9 | 41126468887 |
10 | 14390641519 |
11 | 6115161a71 |
12 | 2957491667 |
13 | 14845248c7 |
14 | 9a7322c59 |
15 | 593598bb4 |
hex | 359bfc36f |
14390641519 has 2 divisors, whose sum is σ = 14390641520. Its totient is φ = 14390641518.
The previous prime is 14390641511. The next prime is 14390641549. The reversal of 14390641519 is 91514609341.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 14390641519 - 23 = 14390641511 is a prime.
It is a super-2 number, since 2×143906415192 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14390641511) 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, 7195320759 + 7195320760.
It is an arithmetic number, because the mean of its divisors is an integer number (7195320760).
Almost surely, 214390641519 is an apocalyptic number.
14390641519 is a deficient number, since it is larger than the sum of its proper divisors (1).
14390641519 is an equidigital number, since it uses as much as digits as its factorization.
14390641519 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 14390641519 in words is "fourteen billion, three hundred ninety million, six hundred forty-one thousand, five hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •