Base | Representation |
---|---|
bin | 11000111010010… |
… | …000100000010101 |
3 | 1002010101210111221 |
4 | 120322100200111 |
5 | 1323442101031 |
6 | 105245330341 |
7 | 13233206434 |
oct | 3072204025 |
9 | 1063353457 |
10 | 417925141 |
11 | 1a49a9387 |
12 | b7b669b1 |
13 | 687794aa |
14 | 3d70d11b |
15 | 26a54a11 |
hex | 18e90815 |
417925141 has 2 divisors, whose sum is σ = 417925142. Its totient is φ = 417925140.
The previous prime is 417925103. The next prime is 417925153. The reversal of 417925141 is 141529714.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 410224516 + 7700625 = 20254^2 + 2775^2 .
It is a cyclic number.
It is not a de Polignac number, because 417925141 - 213 = 417916949 is a prime.
It is a super-2 number, since 2×4179251412 = 349322846959739762, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 417925097 and 417925106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (417925741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 208962570 + 208962571.
It is an arithmetic number, because the mean of its divisors is an integer number (208962571).
Almost surely, 2417925141 is an apocalyptic number.
It is an amenable number.
417925141 is a deficient number, since it is larger than the sum of its proper divisors (1).
417925141 is an equidigital number, since it uses as much as digits as its factorization.
417925141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10080, while the sum is 34.
The square root of 417925141 is about 20443.2174816001. The cubic root of 417925141 is about 747.6519996784.
The spelling of 417925141 in words is "four hundred seventeen million, nine hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •