Base | Representation |
---|---|
bin | 1100110110110101010100… |
… | …0010100101100000110101 |
3 | 1212001101220120201112222222 |
4 | 3031231111002211200311 |
5 | 3323101331003044222 |
6 | 50022021504332125 |
7 | 2656206216251153 |
oct | 315552502454065 |
9 | 55041816645888 |
10 | 14136164112437 |
11 | 4560128126714 |
12 | 1703824914045 |
13 | 7b705abc4a93 |
14 | 36c2a04663d3 |
15 | 197aa9eb5542 |
hex | cdb550a5835 |
14136164112437 has 2 divisors, whose sum is σ = 14136164112438. Its totient is φ = 14136164112436.
The previous prime is 14136164112377. The next prime is 14136164112439. The reversal of 14136164112437 is 73421146163141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13876824475921 + 259339636516 = 3725161^2 + 509254^2 .
It is a cyclic number.
It is not a de Polignac number, because 14136164112437 - 226 = 14136097003573 is a prime.
It is a super-2 number, since 2×141361641124372 (a number of 27 digits) contains 22 as substring.
Together with 14136164112439, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14136164112439) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7068082056218 + 7068082056219.
It is an arithmetic number, because the mean of its divisors is an integer number (7068082056219).
Almost surely, 214136164112437 is an apocalyptic number.
It is an amenable number.
14136164112437 is a deficient number, since it is larger than the sum of its proper divisors (1).
14136164112437 is an equidigital number, since it uses as much as digits as its factorization.
14136164112437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 290304, while the sum is 44.
The spelling of 14136164112437 in words is "fourteen trillion, one hundred thirty-six billion, one hundred sixty-four million, one hundred twelve thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •