Base | Representation |
---|---|
bin | 1001110011010… |
… | …0010111000101 |
3 | 2212100112212002 |
4 | 2130310113011 |
5 | 41010441213 |
6 | 4025035045 |
7 | 1006264055 |
oct | 234642705 |
9 | 85315762 |
10 | 41108933 |
11 | 21228828 |
12 | 11925a85 |
13 | 8694518 |
14 | 5661565 |
15 | 3920658 |
hex | 27345c5 |
41108933 has 2 divisors, whose sum is σ = 41108934. Its totient is φ = 41108932.
The previous prime is 41108909. The next prime is 41108939. The reversal of 41108933 is 33980114.
41108933 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., 39526369 + 1582564 = 6287^2 + 1258^2 .
It is a cyclic number.
It is not a de Polignac number, because 41108933 - 26 = 41108869 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 41108896 and 41108905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41108939) 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, 20554466 + 20554467.
It is an arithmetic number, because the mean of its divisors is an integer number (20554467).
Almost surely, 241108933 is an apocalyptic number.
It is an amenable number.
41108933 is a deficient number, since it is larger than the sum of its proper divisors (1).
41108933 is an equidigital number, since it uses as much as digits as its factorization.
41108933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 41108933 is about 6411.6248330669. The cubic root of 41108933 is about 345.1268398698.
The spelling of 41108933 in words is "forty-one million, one hundred eight thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •