Base | Representation |
---|---|
bin | 1001111100100… |
… | …0001111010001 |
3 | 2220111022201201 |
4 | 2133020033101 |
5 | 41134332031 |
6 | 4050031201 |
7 | 1014366013 |
oct | 237101721 |
9 | 86438651 |
10 | 41714641 |
11 | 21601911 |
12 | 11b78501 |
13 | 8847127 |
14 | 577c1b3 |
15 | 39ded61 |
hex | 27c83d1 |
41714641 has 2 divisors, whose sum is σ = 41714642. Its totient is φ = 41714640.
The previous prime is 41714639. The next prime is 41714677. The reversal of 41714641 is 14641714.
41714641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 35058241 + 6656400 = 5921^2 + 2580^2 .
It is a cyclic number.
It is not a de Polignac number, because 41714641 - 21 = 41714639 is a prime.
It is a super-2 number, since 2×417146412 = 3480222547517762, which contains 22 as substring.
Together with 41714639, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (41714611) 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, 20857320 + 20857321.
It is an arithmetic number, because the mean of its divisors is an integer number (20857321).
Almost surely, 241714641 is an apocalyptic number.
It is an amenable number.
41714641 is a deficient number, since it is larger than the sum of its proper divisors (1).
41714641 is an equidigital number, since it uses as much as digits as its factorization.
41714641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2688, while the sum is 28.
The square root of 41714641 is about 6458.6872505177. The cubic root of 41714641 is about 346.8136403221.
The spelling of 41714641 in words is "forty-one million, seven hundred fourteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •