Base | Representation |
---|---|
bin | 11010001000011001… |
… | …10011110101110111 |
3 | 1100012201020122212122 |
4 | 31010030303311313 |
5 | 212212423020042 |
6 | 10240032310155 |
7 | 1004440321136 |
oct | 150414636567 |
9 | 40181218778 |
10 | 14029110647 |
11 | 5a4a081522 |
12 | 28763a235b |
13 | 1427662106 |
14 | 9712d391d |
15 | 5719837d2 |
hex | 344333d77 |
14029110647 has 2 divisors, whose sum is σ = 14029110648. Its totient is φ = 14029110646.
The previous prime is 14029110629. The next prime is 14029110649. The reversal of 14029110647 is 74601192041.
It is a strong prime.
It is an emirp because it is prime and its reverse (74601192041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14029110647 - 210 = 14029109623 is a prime.
Together with 14029110649, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14029110649) 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, 7014555323 + 7014555324.
It is an arithmetic number, because the mean of its divisors is an integer number (7014555324).
Almost surely, 214029110647 is an apocalyptic number.
14029110647 is a deficient number, since it is larger than the sum of its proper divisors (1).
14029110647 is an equidigital number, since it uses as much as digits as its factorization.
14029110647 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 35.
The spelling of 14029110647 in words is "fourteen billion, twenty-nine million, one hundred ten thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •