Base | Representation |
---|---|
bin | 1001110011010… |
… | …0101000001111 |
3 | 2212100121100202 |
4 | 2130310220033 |
5 | 41011010111 |
6 | 4025044115 |
7 | 1006300214 |
oct | 234645017 |
9 | 85317322 |
10 | 41110031 |
11 | 21229636 |
12 | 1192663b |
13 | 8694b81 |
14 | 5661b0b |
15 | 3920b3b |
hex | 2734a0f |
41110031 has 2 divisors, whose sum is σ = 41110032. Its totient is φ = 41110030.
The previous prime is 41109989. The next prime is 41110051. The reversal of 41110031 is 13001114.
41110031 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 is a cyclic number.
It is not a de Polignac number, because 41110031 - 26 = 41109967 is a prime.
It is a super-2 number, since 2×411100312 = 3380069297641922, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 41109994 and 41110021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41110051) 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, 20555015 + 20555016.
It is an arithmetic number, because the mean of its divisors is an integer number (20555016).
Almost surely, 241110031 is an apocalyptic number.
41110031 is a deficient number, since it is larger than the sum of its proper divisors (1).
41110031 is an equidigital number, since it uses as much as digits as its factorization.
41110031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 41110031 is about 6411.7104582163. The cubic root of 41110031 is about 345.1299125669.
Adding to 41110031 its reverse (13001114), we get a palindrome (54111145).
The spelling of 41110031 in words is "forty-one million, one hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •