Base | Representation |
---|---|
bin | 1001110100100… |
… | …1101011000101 |
3 | 2212111222121021 |
4 | 2131021223011 |
5 | 41021234404 |
6 | 4030551141 |
7 | 1010106424 |
oct | 235115305 |
9 | 85458537 |
10 | 41196229 |
11 | 21288378 |
12 | 119684b1 |
13 | 86c5189 |
14 | 56852bb |
15 | 393b454 |
hex | 2749ac5 |
41196229 has 2 divisors, whose sum is σ = 41196230. Its totient is φ = 41196228.
The previous prime is 41196227. The next prime is 41196251. The reversal of 41196229 is 92269114.
41196229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20702500 + 20493729 = 4550^2 + 4527^2 .
It is a cyclic number.
It is not a de Polignac number, because 41196229 - 21 = 41196227 is a prime.
Together with 41196227, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 41196194 and 41196203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41196227) 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, 20598114 + 20598115.
It is an arithmetic number, because the mean of its divisors is an integer number (20598115).
Almost surely, 241196229 is an apocalyptic number.
It is an amenable number.
41196229 is a deficient number, since it is larger than the sum of its proper divisors (1).
41196229 is an equidigital number, since it uses as much as digits as its factorization.
41196229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7776, while the sum is 34.
The square root of 41196229 is about 6418.4288575944. The cubic root of 41196229 is about 345.3709627365.
The spelling of 41196229 in words is "forty-one million, one hundred ninety-six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •