Base | Representation |
---|---|
bin | 101101100001011110000100… |
… | …0101001110001010110001011 |
3 | 1221111210011221211211001021112 |
4 | 1123002330020221301112023 |
5 | 404441022321213004011 |
6 | 3535344205031000535 |
7 | 150225460660061234 |
oct | 13302741051612613 |
9 | 1844704854731245 |
10 | 400424241141131 |
11 | 106650a700a4129 |
12 | 38ab0a9820914b |
13 | 14257ac811578c |
14 | 70c48cb09808b |
15 | 3145e47c9c58b |
hex | 16c2f08a7158b |
400424241141131 has 2 divisors, whose sum is σ = 400424241141132. Its totient is φ = 400424241141130.
The previous prime is 400424241141101. The next prime is 400424241141139. The reversal of 400424241141131 is 131141142424004.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-400424241141131 is a prime.
It is a super-2 number, since 2×4004242411411312 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (400424241141139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200212120570565 + 200212120570566.
It is an arithmetic number, because the mean of its divisors is an integer number (200212120570566).
Almost surely, 2400424241141131 is an apocalyptic number.
400424241141131 is a deficient number, since it is larger than the sum of its proper divisors (1).
400424241141131 is an equidigital number, since it uses as much as digits as its factorization.
400424241141131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12288, while the sum is 32.
Adding to 400424241141131 its reverse (131141142424004), we get a palindrome (531565383565135).
The spelling of 400424241141131 in words is "four hundred trillion, four hundred twenty-four billion, two hundred forty-one million, one hundred forty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •