Base | Representation |
---|---|
bin | 10010001111111111110000… |
… | …10000111011100111101001 |
3 | 12021002120211012012110022202 |
4 | 21013333320100323213221 |
5 | 20230010411411301401 |
6 | 221204223511025545 |
7 | 11311305322652633 |
oct | 1107777020734751 |
9 | 167076735173282 |
10 | 40132044634601 |
11 | 118729a4a57467 |
12 | 4601a3866b2b5 |
13 | 1951587c4384a |
14 | 9ca58933ba53 |
15 | 498dd730d06b |
hex | 247ff843b9e9 |
40132044634601 has 2 divisors, whose sum is σ = 40132044634602. Its totient is φ = 40132044634600.
The previous prime is 40132044634579. The next prime is 40132044634727. The reversal of 40132044634601 is 10643644023104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39470107810576 + 661936824025 = 6282524^2 + 813595^2 .
It is a cyclic number.
It is not a de Polignac number, because 40132044634601 - 26 = 40132044634537 is a prime.
It is a super-2 number, since 2×401320446346012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40132044634501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20066022317300 + 20066022317301.
It is an arithmetic number, because the mean of its divisors is an integer number (20066022317301).
Almost surely, 240132044634601 is an apocalyptic number.
It is an amenable number.
40132044634601 is a deficient number, since it is larger than the sum of its proper divisors (1).
40132044634601 is an equidigital number, since it uses as much as digits as its factorization.
40132044634601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 165888, while the sum is 38.
Adding to 40132044634601 its reverse (10643644023104), we get a palindrome (50775688657705).
The spelling of 40132044634601 in words is "forty trillion, one hundred thirty-two billion, forty-four million, six hundred thirty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •