Base | Representation |
---|---|
bin | 11000100111111… |
… | …001011010101101 |
3 | 1001210100021002202 |
4 | 120213321122231 |
5 | 1321224040411 |
6 | 104554231245 |
7 | 13144252052 |
oct | 3047713255 |
9 | 1053307082 |
10 | 413111981 |
11 | 1a2211167 |
12 | b6425525 |
13 | 67782779 |
14 | 3cc19029 |
15 | 2640383b |
hex | 189f96ad |
413111981 has 2 divisors, whose sum is σ = 413111982. Its totient is φ = 413111980.
The previous prime is 413111971. The next prime is 413112043. The reversal of 413111981 is 189111314.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 291009481 + 122102500 = 17059^2 + 11050^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-413111981 is a prime.
It is a super-2 number, since 2×4131119812 = 341323017691488722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (413111971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 206555990 + 206555991.
It is an arithmetic number, because the mean of its divisors is an integer number (206555991).
Almost surely, 2413111981 is an apocalyptic number.
It is an amenable number.
413111981 is a deficient number, since it is larger than the sum of its proper divisors (1).
413111981 is an equidigital number, since it uses as much as digits as its factorization.
413111981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864, while the sum is 29.
The square root of 413111981 is about 20325.1563585622. The cubic root of 413111981 is about 744.7707241559.
It can be divided in two parts, 413 and 111981, that multiplied together give a triangular number (46248153 = T9617).
The spelling of 413111981 in words is "four hundred thirteen million, one hundred eleven thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •