Base | Representation |
---|---|
bin | 1100111000001010011110… |
… | …1111111101100110110101 |
3 | 1212010120220220111000210012 |
4 | 3032002213233331212311 |
5 | 3323440141300411142 |
6 | 50040322250310005 |
7 | 2660645610060245 |
oct | 316024757754665 |
9 | 55116826430705 |
10 | 14159026575797 |
11 | 456989a416834 |
12 | 1708145428305 |
13 | 7b9262629bcc |
14 | 36d42c991b25 |
15 | 1984971a8882 |
hex | ce0a7bfd9b5 |
14159026575797 has 2 divisors, whose sum is σ = 14159026575798. Its totient is φ = 14159026575796.
The previous prime is 14159026575721. The next prime is 14159026575907. The reversal of 14159026575797 is 79757562095141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11517104666596 + 2641921909201 = 3393686^2 + 1625399^2 .
It is a cyclic number.
It is not a de Polignac number, because 14159026575797 - 234 = 14141846706613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14159026575997) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7079513287898 + 7079513287899.
It is an arithmetic number, because the mean of its divisors is an integer number (7079513287899).
Almost surely, 214159026575797 is an apocalyptic number.
It is an amenable number.
14159026575797 is a deficient number, since it is larger than the sum of its proper divisors (1).
14159026575797 is an equidigital number, since it uses as much as digits as its factorization.
14159026575797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 166698000, while the sum is 68.
The spelling of 14159026575797 in words is "fourteen trillion, one hundred fifty-nine billion, twenty-six million, five hundred seventy-five thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •