Base | Representation |
---|---|
bin | 1001110101000… |
… | …0011101001101 |
3 | 2212120101201022 |
4 | 2131100131031 |
5 | 41023132023 |
6 | 4031323525 |
7 | 1010253425 |
oct | 235203515 |
9 | 85511638 |
10 | 41224013 |
11 | 212a7236 |
12 | 119805a5 |
13 | 8704a0c |
14 | 5691485 |
15 | 39447c8 |
hex | 275074d |
41224013 has 2 divisors, whose sum is σ = 41224014. Its totient is φ = 41224012.
The previous prime is 41223967. The next prime is 41224019. The reversal of 41224013 is 31042214.
41224013 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., 36264484 + 4959529 = 6022^2 + 2227^2 .
It is a cyclic number.
It is not a de Polignac number, because 41224013 - 222 = 37029709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41223982 and 41224000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41224019) 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, 20612006 + 20612007.
It is an arithmetic number, because the mean of its divisors is an integer number (20612007).
Almost surely, 241224013 is an apocalyptic number.
It is an amenable number.
41224013 is a deficient number, since it is larger than the sum of its proper divisors (1).
41224013 is an equidigital number, since it uses as much as digits as its factorization.
41224013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 17.
The square root of 41224013 is about 6420.5928853962. The cubic root of 41224013 is about 345.4485882105.
Adding to 41224013 its reverse (31042214), we get a palindrome (72266227).
The spelling of 41224013 in words is "forty-one million, two hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •