Base | Representation |
---|---|
bin | 1001110110100… |
… | …1001010110001 |
3 | 2212202112120012 |
4 | 2131221022301 |
5 | 41034401413 |
6 | 4033424305 |
7 | 1011154505 |
oct | 235511261 |
9 | 85675505 |
10 | 41325233 |
11 | 21366294 |
12 | 11a0b095 |
13 | 873bb01 |
14 | 56ba305 |
15 | 39647a8 |
hex | 27692b1 |
41325233 has 2 divisors, whose sum is σ = 41325234. Its totient is φ = 41325232.
The previous prime is 41325211. The next prime is 41325239. The reversal of 41325233 is 33252314.
41325233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29408929 + 11916304 = 5423^2 + 3452^2 .
It is a cyclic number.
It is not a de Polignac number, because 41325233 - 26 = 41325169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41325199 and 41325208.
It is not a weakly prime, because it can be changed into another prime (41325239) 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, 20662616 + 20662617.
It is an arithmetic number, because the mean of its divisors is an integer number (20662617).
Almost surely, 241325233 is an apocalyptic number.
It is an amenable number.
41325233 is a deficient number, since it is larger than the sum of its proper divisors (1).
41325233 is an equidigital number, since it uses as much as digits as its factorization.
41325233 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2160, while the sum is 23.
The square root of 41325233 is about 6428.4705023824. The cubic root of 41325233 is about 345.7310912484.
Adding to 41325233 its reverse (33252314), we get a palindrome (74577547).
The spelling of 41325233 in words is "forty-one million, three hundred twenty-five thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •