Base | Representation |
---|---|
bin | 11010001000001101… |
… | …01010110111101111 |
3 | 1100012121012212220112 |
4 | 31010012222313233 |
5 | 212212020013124 |
6 | 10235534010235 |
7 | 1004420535326 |
oct | 150406526757 |
9 | 40177185815 |
10 | 14027501039 |
11 | 5a49182172 |
12 | 287594697b |
13 | 142721a596 |
14 | 970dd50bd |
15 | 57176690e |
hex | 3441aadef |
14027501039 has 2 divisors, whose sum is σ = 14027501040. Its totient is φ = 14027501038.
The previous prime is 14027501017. The next prime is 14027501041. The reversal of 14027501039 is 93010572041.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14027501039 is a prime.
Together with 14027501041, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 14027500996 and 14027501014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14027501009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7013750519 + 7013750520.
It is an arithmetic number, because the mean of its divisors is an integer number (7013750520).
Almost surely, 214027501039 is an apocalyptic number.
14027501039 is a deficient number, since it is larger than the sum of its proper divisors (1).
14027501039 is an equidigital number, since it uses as much as digits as its factorization.
14027501039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 32.
The spelling of 14027501039 in words is "fourteen billion, twenty-seven million, five hundred one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •