Base | Representation |
---|---|
bin | 1100101111101111010101… |
… | …0111111011111110001101 |
3 | 1211121202100122220212000111 |
4 | 3023323311113323332031 |
5 | 3314102241300344204 |
6 | 45450025222000021 |
7 | 2644333263426643 |
oct | 313736527737615 |
9 | 54552318825014 |
10 | 14014300012429 |
11 | 4513482006682 |
12 | 16a4094876011 |
13 | 7a8709766472 |
14 | 36641d71d193 |
15 | 194826543d04 |
hex | cbef55fbf8d |
14014300012429 has 2 divisors, whose sum is σ = 14014300012430. Its totient is φ = 14014300012428.
The previous prime is 14014300012351. The next prime is 14014300012441. The reversal of 14014300012429 is 92421000341041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13921517634025 + 92782378404 = 3731155^2 + 304602^2 .
It is a cyclic number.
It is not a de Polignac number, because 14014300012429 - 29 = 14014300011917 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14014300012429.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14014300012459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7007150006214 + 7007150006215.
It is an arithmetic number, because the mean of its divisors is an integer number (7007150006215).
Almost surely, 214014300012429 is an apocalyptic number.
It is an amenable number.
14014300012429 is a deficient number, since it is larger than the sum of its proper divisors (1).
14014300012429 is an equidigital number, since it uses as much as digits as its factorization.
14014300012429 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 14014300012429 in words is "fourteen trillion, fourteen billion, three hundred million, twelve thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •