Base | Representation |
---|---|
bin | 1100110001001111000111… |
… | …1111010000001010000111 |
3 | 1211201012201122110122121122 |
4 | 3030103301333100022013 |
5 | 3320012421312414024 |
6 | 45505520512504155 |
7 | 2646233416352024 |
oct | 314236177201207 |
9 | 54635648418548 |
10 | 14040013013639 |
11 | 4523377361aa8 |
12 | 16a906bb4b05b |
13 | 7aac76911992 |
14 | 36777c66654b |
15 | 19532db05d5e |
hex | cc4f1fd0287 |
14040013013639 has 2 divisors, whose sum is σ = 14040013013640. Its totient is φ = 14040013013638.
The previous prime is 14040013013519. The next prime is 14040013013647. The reversal of 14040013013639 is 93631031004041.
14040013013639 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 is an emirp because it is prime and its reverse (93631031004041) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14040013013639 - 216 = 14040012948103 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 14040013013599 and 14040013013608.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14040013013659) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7020006506819 + 7020006506820.
It is an arithmetic number, because the mean of its divisors is an integer number (7020006506820).
Almost surely, 214040013013639 is an apocalyptic number.
14040013013639 is a deficient number, since it is larger than the sum of its proper divisors (1).
14040013013639 is an equidigital number, since it uses as much as digits as its factorization.
14040013013639 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 35.
The spelling of 14040013013639 in words is "fourteen trillion, forty billion, thirteen million, thirteen thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •