Base | Representation |
---|---|
bin | 11000111110101111… |
… | …01010101111101101 |
3 | 1021121122112112210102 |
4 | 30133113222233231 |
5 | 204431231344411 |
6 | 10054440320445 |
7 | 653225214254 |
oct | 143727525755 |
9 | 37548475712 |
10 | 13411199981 |
11 | 5762300053 |
12 | 2723473125 |
13 | 13596350ba |
14 | 91320779b |
15 | 5375c8d3b |
hex | 31f5eabed |
13411199981 has 2 divisors, whose sum is σ = 13411199982. Its totient is φ = 13411199980.
The previous prime is 13411199969. The next prime is 13411199983. The reversal of 13411199981 is 18999111431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13410798025 + 401956 = 115805^2 + 634^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13411199981 is a prime.
It is a super-3 number, since 3×134111999813 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
Together with 13411199983, 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 (13411199983) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6705599990 + 6705599991.
It is an arithmetic number, because the mean of its divisors is an integer number (6705599991).
Almost surely, 213411199981 is an apocalyptic number.
It is an amenable number.
13411199981 is a deficient number, since it is larger than the sum of its proper divisors (1).
13411199981 is an equidigital number, since it uses as much as digits as its factorization.
13411199981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 69984, while the sum is 47.
The spelling of 13411199981 in words is "thirteen billion, four hundred eleven million, one hundred ninety-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •