Base | Representation |
---|---|
bin | 110101110011… |
… | …000111000101 |
3 | 222112111122122 |
4 | 311303013011 |
5 | 12102243411 |
6 | 1222135325 |
7 | 230605364 |
oct | 65630705 |
9 | 28474578 |
10 | 14102981 |
11 | 7a62862 |
12 | 4881545 |
13 | 2bca279 |
14 | 1c317db |
15 | 13889db |
hex | d731c5 |
14102981 has 2 divisors, whose sum is σ = 14102982. Its totient is φ = 14102980.
The previous prime is 14102971. The next prime is 14102987. The reversal of 14102981 is 18920141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9302500 + 4800481 = 3050^2 + 2191^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14102981 is a prime.
It is a super-2 number, since 2×141029812 = 397788146172722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen 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 14102981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14102987) 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, 7051490 + 7051491.
It is an arithmetic number, because the mean of its divisors is an integer number (7051491).
Almost surely, 214102981 is an apocalyptic number.
It is an amenable number.
14102981 is a deficient number, since it is larger than the sum of its proper divisors (1).
14102981 is an equidigital number, since it uses as much as digits as its factorization.
14102981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
The square root of 14102981 is about 3755.3935878946. The cubic root of 14102981 is about 241.6037330114.
The spelling of 14102981 in words is "fourteen million, one hundred two thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •