Base | Representation |
---|---|
bin | 1101000001001101011010… |
… | …0001100010011000001001 |
3 | 1212200110001020201100112121 |
4 | 3100103112201202120021 |
5 | 3334011423104133212 |
6 | 50235543004211241 |
7 | 3005116631450536 |
oct | 320232641423011 |
9 | 55613036640477 |
10 | 14314430146057 |
11 | 4619796706228 |
12 | 1732295839b21 |
13 | 7caaca529602 |
14 | 376b71c57d8d |
15 | 19c54035ad07 |
hex | d04d6862609 |
14314430146057 has 2 divisors, whose sum is σ = 14314430146058. Its totient is φ = 14314430146056.
The previous prime is 14314430145989. The next prime is 14314430146097. The reversal of 14314430146057 is 75064103441341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13268032085961 + 1046398060096 = 3642531^2 + 1022936^2 .
It is a cyclic number.
It is not a de Polignac number, because 14314430146057 - 219 = 14314429621769 is a prime.
It is not a weakly prime, because it can be changed into another prime (14314430146097) 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, 7157215073028 + 7157215073029.
It is an arithmetic number, because the mean of its divisors is an integer number (7157215073029).
Almost surely, 214314430146057 is an apocalyptic number.
It is an amenable number.
14314430146057 is a deficient number, since it is larger than the sum of its proper divisors (1).
14314430146057 is an equidigital number, since it uses as much as digits as its factorization.
14314430146057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 483840, while the sum is 43.
Adding to 14314430146057 its reverse (75064103441341), we get a palindrome (89378533587398).
The spelling of 14314430146057 in words is "fourteen trillion, three hundred fourteen billion, four hundred thirty million, one hundred forty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •