Base | Representation |
---|---|
bin | 1101000100000100011101… |
… | …0001111001111101011001 |
3 | 1212212010212122110110201022 |
4 | 3101001013101321331121 |
5 | 3340313041011422014 |
6 | 50314310435132225 |
7 | 3011506365624566 |
oct | 321010721717531 |
9 | 55763778413638 |
10 | 14363566514009 |
11 | 4638610926789 |
12 | 173b909444075 |
13 | 80262b39724b |
14 | 3792b39b786d |
15 | 19d968ea9a8e |
hex | d1047479f59 |
14363566514009 has 2 divisors, whose sum is σ = 14363566514010. Its totient is φ = 14363566514008.
The previous prime is 14363566513939. The next prime is 14363566514053. The reversal of 14363566514009 is 90041566536341.
It is a happy number.
14363566514009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11070259840000 + 3293306674009 = 3327200^2 + 1814747^2 .
It is a cyclic number.
It is not a de Polignac number, because 14363566514009 - 224 = 14363549736793 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (14363566514309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7181783257004 + 7181783257005.
It is an arithmetic number, because the mean of its divisors is an integer number (7181783257005).
Almost surely, 214363566514009 is an apocalyptic number.
It is an amenable number.
14363566514009 is a deficient number, since it is larger than the sum of its proper divisors (1).
14363566514009 is an equidigital number, since it uses as much as digits as its factorization.
14363566514009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6998400, while the sum is 53.
The spelling of 14363566514009 in words is "fourteen trillion, three hundred sixty-three billion, five hundred sixty-six million, five hundred fourteen thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •