Base | Representation |
---|---|
bin | 11010010001000110… |
… | …00001001000011101 |
3 | 1100101210110220200011 |
4 | 31020203001020131 |
5 | 212340110303432 |
6 | 10251155403221 |
7 | 1006314241333 |
oct | 151043011035 |
9 | 40353426604 |
10 | 14102041117 |
11 | 5a8726423a |
12 | 28968b3511 |
13 | 14397b8738 |
14 | 97ac79b53 |
15 | 57808c847 |
hex | 3488c121d |
14102041117 has 2 divisors, whose sum is σ = 14102041118. Its totient is φ = 14102041116.
The previous prime is 14102041111. The next prime is 14102041123. The reversal of 14102041117 is 71114020141.
It is a balanced prime because it is at equal distance from previous prime (14102041111) and next prime (14102041123).
It can be written as a sum of positive squares in only one way, i.e., 14097050361 + 4990756 = 118731^2 + 2234^2 .
It is an emirp because it is prime and its reverse (71114020141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14102041117 - 27 = 14102040989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14102041111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7051020558 + 7051020559.
It is an arithmetic number, because the mean of its divisors is an integer number (7051020559).
Almost surely, 214102041117 is an apocalyptic number.
It is an amenable number.
14102041117 is a deficient number, since it is larger than the sum of its proper divisors (1).
14102041117 is an equidigital number, since it uses as much as digits as its factorization.
14102041117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 14102041117 its reverse (71114020141), we get a palindrome (85216061258).
The spelling of 14102041117 in words is "fourteen billion, one hundred two million, forty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •