Base | Representation |
---|---|
bin | 1101011100010001001110… |
… | …1010100101110101011001 |
3 | 1221022212222200200121101222 |
4 | 3113010103222211311121 |
5 | 3414121012433211112 |
6 | 51233304500221425 |
7 | 3053525065421123 |
oct | 327042352456531 |
9 | 57285880617358 |
10 | 14779312397657 |
11 | 4788964609565 |
12 | 17a83b599a875 |
13 | 8328b5c375b2 |
14 | 391473080213 |
15 | 1a969ce00372 |
hex | d7113aa5d59 |
14779312397657 has 2 divisors, whose sum is σ = 14779312397658. Its totient is φ = 14779312397656.
The previous prime is 14779312397611. The next prime is 14779312397701. The reversal of 14779312397657 is 75679321397741.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10549692384841 + 4229620012816 = 3248029^2 + 2056604^2 .
It is an emirp because it is prime and its reverse (75679321397741) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14779312397657 - 228 = 14779043962201 is a prime.
It is not a weakly prime, because it can be changed into another prime (14779312307657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7389656198828 + 7389656198829.
It is an arithmetic number, because the mean of its divisors is an integer number (7389656198829).
Almost surely, 214779312397657 is an apocalyptic number.
It is an amenable number.
14779312397657 is a deficient number, since it is larger than the sum of its proper divisors (1).
14779312397657 is an equidigital number, since it uses as much as digits as its factorization.
14779312397657 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 420078960, while the sum is 71.
The spelling of 14779312397657 in words is "fourteen trillion, seven hundred seventy-nine billion, three hundred twelve million, three hundred ninety-seven thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •