Base | Representation |
---|---|
bin | 10010011000011101000100… |
… | …10011100101000010110001 |
3 | 12022010100221200210001212112 |
4 | 21030032202103211002301 |
5 | 20244241102011422423 |
6 | 221545525212335105 |
7 | 11341304130026501 |
oct | 1114164223450261 |
9 | 168110850701775 |
10 | 40422660264113 |
11 | 119751769a2276 |
12 | 464a223174495 |
13 | 1972ac07938ba |
14 | 9da677db1a01 |
15 | 4a1745bb7a78 |
hex | 24c3a24e50b1 |
40422660264113 has 2 divisors, whose sum is σ = 40422660264114. Its totient is φ = 40422660264112.
The previous prime is 40422660264067. The next prime is 40422660264163. The reversal of 40422660264113 is 31146206622404.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29308017761344 + 11114642502769 = 5413688^2 + 3333863^2 .
It is a cyclic number.
It is not a de Polignac number, because 40422660264113 - 216 = 40422660198577 is a prime.
It is not a weakly prime, because it can be changed into another prime (40422660264163) 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, 20211330132056 + 20211330132057.
It is an arithmetic number, because the mean of its divisors is an integer number (20211330132057).
Almost surely, 240422660264113 is an apocalyptic number.
It is an amenable number.
40422660264113 is a deficient number, since it is larger than the sum of its proper divisors (1).
40422660264113 is an equidigital number, since it uses as much as digits as its factorization.
40422660264113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 331776, while the sum is 41.
Adding to 40422660264113 its reverse (31146206622404), we get a palindrome (71568866886517).
The spelling of 40422660264113 in words is "forty trillion, four hundred twenty-two billion, six hundred sixty million, two hundred sixty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •