Base | Representation |
---|---|
bin | 10010001101011000000111… |
… | …10101010010001010000101 |
3 | 12020202222111220212211202011 |
4 | 21012230003311102022011 |
5 | 20222022101331302021 |
6 | 221055021121414221 |
7 | 11301641121412111 |
oct | 1106540365221205 |
9 | 166688456784664 |
10 | 40042044400261 |
11 | 11838810196302 |
12 | 45a84bb79a371 |
13 | 1945c4406ba07 |
14 | 9c608c3bc741 |
15 | 4968bae36de1 |
hex | 246b03d52285 |
40042044400261 has 2 divisors, whose sum is σ = 40042044400262. Its totient is φ = 40042044400260.
The previous prime is 40042044400151. The next prime is 40042044400297. The reversal of 40042044400261 is 16200444024004.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27270391075236 + 12771653325025 = 5222106^2 + 3573745^2 .
It is a cyclic number.
It is not a de Polignac number, because 40042044400261 - 27 = 40042044400133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40042044400861) 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, 20021022200130 + 20021022200131.
It is an arithmetic number, because the mean of its divisors is an integer number (20021022200131).
Almost surely, 240042044400261 is an apocalyptic number.
It is an amenable number.
40042044400261 is a deficient number, since it is larger than the sum of its proper divisors (1).
40042044400261 is an equidigital number, since it uses as much as digits as its factorization.
40042044400261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24576, while the sum is 31.
Adding to 40042044400261 its reverse (16200444024004), we get a palindrome (56242488424265).
The spelling of 40042044400261 in words is "forty trillion, forty-two billion, forty-four million, four hundred thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •