Base | Representation |
---|---|
bin | 11010110100001001… |
… | …00110111100111011 |
3 | 1101011021201121000002 |
4 | 31122010212330323 |
5 | 213440342400301 |
6 | 10340301303215 |
7 | 1016514325544 |
oct | 153204467473 |
9 | 41137647002 |
10 | 14396059451 |
11 | 61182225a4 |
12 | 2959264b0b |
13 | 14856a0997 |
14 | 9a7d334cb |
15 | 593cb916b |
hex | 35a126f3b |
14396059451 has 2 divisors, whose sum is σ = 14396059452. Its totient is φ = 14396059450.
The previous prime is 14396059387. The next prime is 14396059477. The reversal of 14396059451 is 15495069341.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14396059451 - 26 = 14396059387 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 14396059396 and 14396059405.
It is not a weakly prime, because it can be changed into another prime (14396059481) 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, 7198029725 + 7198029726.
It is an arithmetic number, because the mean of its divisors is an integer number (7198029726).
Almost surely, 214396059451 is an apocalyptic number.
14396059451 is a deficient number, since it is larger than the sum of its proper divisors (1).
14396059451 is an equidigital number, since it uses as much as digits as its factorization.
14396059451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 583200, while the sum is 47.
The spelling of 14396059451 in words is "fourteen billion, three hundred ninety-six million, fifty-nine thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •