Base | Representation |
---|---|
bin | 11000100111111… |
… | …001111110011101 |
3 | 1001210100101020111 |
4 | 120213321332131 |
5 | 1321224124034 |
6 | 104554250021 |
7 | 13144261531 |
oct | 3047717635 |
9 | 1053311214 |
10 | 413114269 |
11 | 1a2212957 |
12 | b6426911 |
13 | 67783819 |
14 | 3cc19bc1 |
15 | 26404364 |
hex | 189f9f9d |
413114269 has 2 divisors, whose sum is σ = 413114270. Its totient is φ = 413114268.
The previous prime is 413114203. The next prime is 413114333. The reversal of 413114269 is 962411314.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 337163044 + 75951225 = 18362^2 + 8715^2 .
It is a cyclic number.
It is not a de Polignac number, because 413114269 - 223 = 404725661 is a prime.
It is a super-2 number, since 2×4131142692 = 341326798502808722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 413114269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (413114069) 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, 206557134 + 206557135.
It is an arithmetic number, because the mean of its divisors is an integer number (206557135).
Almost surely, 2413114269 is an apocalyptic number.
It is an amenable number.
413114269 is a deficient number, since it is larger than the sum of its proper divisors (1).
413114269 is an equidigital number, since it uses as much as digits as its factorization.
413114269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 31.
The square root of 413114269 is about 20325.2126434141. The cubic root of 413114269 is about 744.7720991118.
The spelling of 413114269 in words is "four hundred thirteen million, one hundred fourteen thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •