Base | Representation |
---|---|
bin | 100101011100010111… |
… | …101111001101110001 |
3 | 10211202220201202210222 |
4 | 211130113233031301 |
5 | 1124314313312431 |
6 | 30245240302425 |
7 | 2622206015111 |
oct | 453427571561 |
9 | 124686652728 |
10 | 40204432241 |
11 | 16061399006 |
12 | 7960471a15 |
13 | 3a3952c09c |
14 | 1d357c5041 |
15 | 10a491957b |
hex | 95c5ef371 |
40204432241 has 2 divisors, whose sum is σ = 40204432242. Its totient is φ = 40204432240.
The previous prime is 40204432211. The next prime is 40204432267. The reversal of 40204432241 is 14223440204.
It is a happy number.
It is an a-pointer prime, because the next prime (40204432267) can be obtained adding 40204432241 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 39188161600 + 1016270641 = 197960^2 + 31879^2 .
It is a cyclic number.
It is not a de Polignac number, because 40204432241 - 210 = 40204431217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 40204432241.
It is not a weakly prime, because it can be changed into another prime (40204432211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20102216120 + 20102216121.
It is an arithmetic number, because the mean of its divisors is an integer number (20102216121).
Almost surely, 240204432241 is an apocalyptic number.
It is an amenable number.
40204432241 is a deficient number, since it is larger than the sum of its proper divisors (1).
40204432241 is an equidigital number, since it uses as much as digits as its factorization.
40204432241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 26.
Adding to 40204432241 its reverse (14223440204), we get a palindrome (54427872445).
The spelling of 40204432241 in words is "forty billion, two hundred four million, four hundred thirty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •