Base | Representation |
---|---|
bin | 1001111100001… |
… | …0010110100101 |
3 | 2220110002122211 |
4 | 2133002112211 |
5 | 41133044113 |
6 | 4045323421 |
7 | 1014235513 |
oct | 237022645 |
9 | 86402584 |
10 | 41690533 |
11 | 21595795 |
12 | 11b66571 |
13 | 8839171 |
14 | 57734b3 |
15 | 39d7b3d |
hex | 27c25a5 |
41690533 has 2 divisors, whose sum is σ = 41690534. Its totient is φ = 41690532.
The previous prime is 41690531. The next prime is 41690543. The reversal of 41690533 is 33509614.
41690533 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., 40170244 + 1520289 = 6338^2 + 1233^2 .
It is a cyclic number.
It is not a de Polignac number, because 41690533 - 21 = 41690531 is a prime.
Together with 41690531, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 41690495 and 41690504.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41690531) 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, 20845266 + 20845267.
It is an arithmetic number, because the mean of its divisors is an integer number (20845267).
Almost surely, 241690533 is an apocalyptic number.
It is an amenable number.
41690533 is a deficient number, since it is larger than the sum of its proper divisors (1).
41690533 is an equidigital number, since it uses as much as digits as its factorization.
41690533 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 31.
The square root of 41690533 is about 6456.8206572585. The cubic root of 41690533 is about 346.7468165064.
The spelling of 41690533 in words is "forty-one million, six hundred ninety thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •