Base | Representation |
---|---|
bin | 1100111010101100001100… |
… | …1101100111010001001101 |
3 | 1212021201222020212101120201 |
4 | 3032223003031213101031 |
5 | 3330143042333201123 |
6 | 50112302014413501 |
7 | 2664043425460405 |
oct | 316530315472115 |
9 | 55251866771521 |
10 | 14202437006413 |
11 | 4586246484877 |
12 | 171463b501291 |
13 | 7c0390117b46 |
14 | 37158a083805 |
15 | 1996882a85ad |
hex | ceac336744d |
14202437006413 has 2 divisors, whose sum is σ = 14202437006414. Its totient is φ = 14202437006412.
The previous prime is 14202437006369. The next prime is 14202437006441. The reversal of 14202437006413 is 31460073420241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11489916943684 + 2712520062729 = 3389678^2 + 1646973^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14202437006413 is a prime.
It is a super-2 number, since 2×142024370064132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14202437006113) 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, 7101218503206 + 7101218503207.
It is an arithmetic number, because the mean of its divisors is an integer number (7101218503207).
Almost surely, 214202437006413 is an apocalyptic number.
It is an amenable number.
14202437006413 is a deficient number, since it is larger than the sum of its proper divisors (1).
14202437006413 is an equidigital number, since it uses as much as digits as its factorization.
14202437006413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 37.
The spelling of 14202437006413 in words is "fourteen trillion, two hundred two billion, four hundred thirty-seven million, six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •