Base | Representation |
---|---|
bin | 1001110101000… |
… | …1001100010111 |
3 | 2212120112212002 |
4 | 2131101030113 |
5 | 41023231111 |
6 | 4031345515 |
7 | 1010265266 |
oct | 235211427 |
9 | 85515762 |
10 | 41227031 |
11 | 212a952a |
12 | 1198229b |
13 | 87061c1 |
14 | 56925dd |
15 | 394563b |
hex | 2751317 |
41227031 has 2 divisors, whose sum is σ = 41227032. Its totient is φ = 41227030.
The previous prime is 41226967. The next prime is 41227049. The reversal of 41227031 is 13072214.
41227031 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 41227031 - 26 = 41226967 is a prime.
It is a super-2 number, since 2×412270312 = 3399336170149922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 41226994 and 41227012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41227061) 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, 20613515 + 20613516.
It is an arithmetic number, because the mean of its divisors is an integer number (20613516).
Almost surely, 241227031 is an apocalyptic number.
41227031 is a deficient number, since it is larger than the sum of its proper divisors (1).
41227031 is an equidigital number, since it uses as much as digits as its factorization.
41227031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 20.
The square root of 41227031 is about 6420.8279061193. The cubic root of 41227031 is about 345.4570180739.
Adding to 41227031 its reverse (13072214), we get a palindrome (54299245).
The spelling of 41227031 in words is "forty-one million, two hundred twenty-seven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •