Base | Representation |
---|---|
bin | 11010010101110010… |
… | …01100101001110111 |
3 | 1100111112120001111122 |
4 | 31022321030221313 |
5 | 212430200104121 |
6 | 10255123254155 |
7 | 1010303000216 |
oct | 151271145167 |
9 | 40445501448 |
10 | 14141409911 |
11 | 5aa7503632 |
12 | 28a7b1a35b |
13 | 14449c0b95 |
14 | 9821a707d |
15 | 57b7675ab |
hex | 34ae4ca77 |
14141409911 has 2 divisors, whose sum is σ = 14141409912. Its totient is φ = 14141409910.
The previous prime is 14141409901. The next prime is 14141409913. The reversal of 14141409911 is 11990414141.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 14141409911 - 26 = 14141409847 is a prime.
It is a Sophie Germain prime.
Together with 14141409913, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14141409913) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7070704955 + 7070704956.
It is an arithmetic number, because the mean of its divisors is an integer number (7070704956).
Almost surely, 214141409911 is an apocalyptic number.
14141409911 is a deficient number, since it is larger than the sum of its proper divisors (1).
14141409911 is an equidigital number, since it uses as much as digits as its factorization.
14141409911 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 35.
The spelling of 14141409911 in words is "fourteen billion, one hundred forty-one million, four hundred nine thousand, nine hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •