Base | Representation |
---|---|
bin | 11010001010001100… |
… | …11011001101111101 |
3 | 1100020202122222222022 |
4 | 31011012123031331 |
5 | 212230304323031 |
6 | 10241332125525 |
7 | 1005012564506 |
oct | 150506331575 |
9 | 40222588868 |
10 | 14044214141 |
11 | 5a57657a51 |
12 | 287b4668a5 |
13 | 142a81c8a9 |
14 | 973305bad |
15 | 572e6897b |
hex | 34519b37d |
14044214141 has 2 divisors, whose sum is σ = 14044214142. Its totient is φ = 14044214140.
The previous prime is 14044214123. The next prime is 14044214189. The reversal of 14044214141 is 14141244041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8108282116 + 5935932025 = 90046^2 + 77045^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14044214141 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14044214141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14044214341) 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, 7022107070 + 7022107071.
It is an arithmetic number, because the mean of its divisors is an integer number (7022107071).
Almost surely, 214044214141 is an apocalyptic number.
It is an amenable number.
14044214141 is a deficient number, since it is larger than the sum of its proper divisors (1).
14044214141 is an equidigital number, since it uses as much as digits as its factorization.
14044214141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2048, while the sum is 26.
Adding to 14044214141 its reverse (14141244041), we get a palindrome (28185458182).
The spelling of 14044214141 in words is "fourteen billion, forty-four million, two hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •