Base | Representation |
---|---|
bin | 1100111000100000111000… |
… | …0001111101111100111001 |
3 | 1212011011102211011121022202 |
4 | 3032020032001331330321 |
5 | 3324034444102223004 |
6 | 50043154534155545 |
7 | 2661250556316551 |
oct | 316101601757471 |
9 | 55134384147282 |
10 | 14165037539129 |
11 | 45713a4455524 |
12 | 17093424b2bb5 |
13 | 7b99aca63b49 |
14 | 36d83d016161 |
15 | 1986e9c59b1e |
hex | ce20e07df39 |
14165037539129 has 2 divisors, whose sum is σ = 14165037539130. Its totient is φ = 14165037539128.
The previous prime is 14165037539087. The next prime is 14165037539131. The reversal of 14165037539129 is 92193573056141.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10732732927225 + 3432304611904 = 3276085^2 + 1852648^2 .
It is a cyclic number.
It is not a de Polignac number, because 14165037539129 - 228 = 14164769103673 is a prime.
Together with 14165037539131, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (14165037539929) 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, 7082518769564 + 7082518769565.
It is an arithmetic number, because the mean of its divisors is an integer number (7082518769565).
Almost surely, 214165037539129 is an apocalyptic number.
It is an amenable number.
14165037539129 is a deficient number, since it is larger than the sum of its proper divisors (1).
14165037539129 is an equidigital number, since it uses as much as digits as its factorization.
14165037539129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6123600, while the sum is 56.
The spelling of 14165037539129 in words is "fourteen trillion, one hundred sixty-five billion, thirty-seven million, five hundred thirty-nine thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •