Base | Representation |
---|---|
bin | 1101000001000010001100… |
… | …1111111100001000001101 |
3 | 1212200011021122010121002011 |
4 | 3100100203033330020031 |
5 | 3333434243114130102 |
6 | 50234324322101221 |
7 | 3004652250231505 |
oct | 320204317741015 |
9 | 55604248117064 |
10 | 14311422411277 |
11 | 4618492942602 |
12 | 17317964aa811 |
13 | 7ca73b3675a4 |
14 | 3769685daa05 |
15 | 19c41628a2d7 |
hex | d04233fc20d |
14311422411277 has 2 divisors, whose sum is σ = 14311422411278. Its totient is φ = 14311422411276.
The previous prime is 14311422411263. The next prime is 14311422411281. The reversal of 14311422411277 is 77211422411341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11727652288356 + 2583770122921 = 3424566^2 + 1607411^2 .
It is a cyclic number.
It is not a de Polignac number, because 14311422411277 - 227 = 14311288193549 is a prime.
It is a super-2 number, since 2×143114224112772 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14311422411217) 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, 7155711205638 + 7155711205639.
It is an arithmetic number, because the mean of its divisors is an integer number (7155711205639).
Almost surely, 214311422411277 is an apocalyptic number.
It is an amenable number.
14311422411277 is a deficient number, since it is larger than the sum of its proper divisors (1).
14311422411277 is an equidigital number, since it uses as much as digits as its factorization.
14311422411277 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 75264, while the sum is 40.
The spelling of 14311422411277 in words is "fourteen trillion, three hundred eleven billion, four hundred twenty-two million, four hundred eleven thousand, two hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •