Base | Representation |
---|---|
bin | 11010000111100111… |
… | …00010101010010101 |
3 | 1100012020210010111102 |
4 | 31003303202222111 |
5 | 212204224033202 |
6 | 10235234315445 |
7 | 1004330112233 |
oct | 150363425225 |
9 | 40166703442 |
10 | 14022486677 |
11 | 5a46367871 |
12 | 2874128b85 |
13 | 14261830c4 |
14 | 97048b953 |
15 | 5710c5d02 |
hex | 343ce2a95 |
14022486677 has 2 divisors, whose sum is σ = 14022486678. Its totient is φ = 14022486676.
The previous prime is 14022486671. The next prime is 14022486679. The reversal of 14022486677 is 77668422041.
14022486677 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13509645361 + 512841316 = 116231^2 + 22646^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14022486677 is a prime.
Together with 14022486679, 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 (14022486671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7011243338 + 7011243339.
It is an arithmetic number, because the mean of its divisors is an integer number (7011243339).
Almost surely, 214022486677 is an apocalyptic number.
It is an amenable number.
14022486677 is a deficient number, since it is larger than the sum of its proper divisors (1).
14022486677 is an equidigital number, since it uses as much as digits as its factorization.
14022486677 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 903168, while the sum is 47.
The spelling of 14022486677 in words is "fourteen billion, twenty-two million, four hundred eighty-six thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •