Base | Representation |
---|---|
bin | 1100110110110111100010… |
… | …0111011100000100101001 |
3 | 1212001110110011211100102011 |
4 | 3031231320213130010221 |
5 | 3323104041302210112 |
6 | 50022201025235521 |
7 | 2656230054434155 |
oct | 315557047340451 |
9 | 55043404740364 |
10 | 14136760975657 |
11 | 4560404031901 |
12 | 1703970792ba1 |
13 | 7b7124762998 |
14 | 36c319834065 |
15 | 197ae25b3aa7 |
hex | cdb789dc129 |
14136760975657 has 2 divisors, whose sum is σ = 14136760975658. Its totient is φ = 14136760975656.
The previous prime is 14136760975637. The next prime is 14136760975739. The reversal of 14136760975657 is 75657906763141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11037650711616 + 3099110264041 = 3322296^2 + 1760429^2 .
It is a cyclic number.
It is not a de Polignac number, because 14136760975657 - 211 = 14136760973609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14136760975592 and 14136760975601.
It is not a weakly prime, because it can be changed into another prime (14136760975637) 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, 7068380487828 + 7068380487829.
It is an arithmetic number, because the mean of its divisors is an integer number (7068380487829).
Almost surely, 214136760975657 is an apocalyptic number.
It is an amenable number.
14136760975657 is a deficient number, since it is larger than the sum of its proper divisors (1).
14136760975657 is an equidigital number, since it uses as much as digits as its factorization.
14136760975657 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 200037600, while the sum is 67.
The spelling of 14136760975657 in words is "fourteen trillion, one hundred thirty-six billion, seven hundred sixty million, nine hundred seventy-five thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •