Base | Representation |
---|---|
bin | 100110101011000111… |
… | …100011100011010101 |
3 | 10222011222201112212022 |
4 | 212223013203203111 |
5 | 1140021022341404 |
6 | 31024313302525 |
7 | 3000020456504 |
oct | 465307434325 |
9 | 128158645768 |
10 | 41525590229 |
11 | 1667a127612 |
12 | 806aa04a45 |
13 | 3bba164586 |
14 | 201d05283b |
15 | 11308d88be |
hex | 9ab1e38d5 |
41525590229 has 2 divisors, whose sum is σ = 41525590230. Its totient is φ = 41525590228.
The previous prime is 41525590133. The next prime is 41525590231. The reversal of 41525590229 is 92209552514.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38338423204 + 3187167025 = 195802^2 + 56455^2 .
It is a cyclic number.
It is not a de Polignac number, because 41525590229 - 216 = 41525524693 is a prime.
Together with 41525590231, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 41525590229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41525590279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20762795114 + 20762795115.
It is an arithmetic number, because the mean of its divisors is an integer number (20762795115).
Almost surely, 241525590229 is an apocalyptic number.
It is an amenable number.
41525590229 is a deficient number, since it is larger than the sum of its proper divisors (1).
41525590229 is an equidigital number, since it uses as much as digits as its factorization.
41525590229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324000, while the sum is 44.
The spelling of 41525590229 in words is "forty-one billion, five hundred twenty-five million, five hundred ninety thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •