Base | Representation |
---|---|
bin | 1101001101000101110010… |
… | …1011100000101101111001 |
3 | 1220101221220022122022001001 |
4 | 3103101130223200231321 |
5 | 3400332434324324203 |
6 | 50513421024325001 |
7 | 3025634030646256 |
oct | 323213453405571 |
9 | 56357808568031 |
10 | 14518544370553 |
11 | 4698309888163 |
12 | 176595b173761 |
13 | 814129021342 |
14 | 3829b650442d |
15 | 1a29d9ab991d |
hex | d345cae0b79 |
14518544370553 has 2 divisors, whose sum is σ = 14518544370554. Its totient is φ = 14518544370552.
The previous prime is 14518544370529. The next prime is 14518544370569. The reversal of 14518544370553 is 35507344581541.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8710213008249 + 5808331362304 = 2951307^2 + 2410048^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14518544370553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14518544370494 and 14518544370503.
It is not a weakly prime, because it can be changed into another prime (14518544370523) 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, 7259272185276 + 7259272185277.
It is an arithmetic number, because the mean of its divisors is an integer number (7259272185277).
Almost surely, 214518544370553 is an apocalyptic number.
It is an amenable number.
14518544370553 is a deficient number, since it is larger than the sum of its proper divisors (1).
14518544370553 is an equidigital number, since it uses as much as digits as its factorization.
14518544370553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160000, while the sum is 55.
The spelling of 14518544370553 in words is "fourteen trillion, five hundred eighteen billion, five hundred forty-four million, three hundred seventy thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •