Base | Representation |
---|---|
bin | 10010011110100110110001… |
… | …01000100101010111001011 |
3 | 12022212120112002002010221121 |
4 | 21033103120220211113023 |
5 | 20311221440413400421 |
6 | 222231002523220111 |
7 | 11362466010561463 |
oct | 1117233050452713 |
9 | 168776462063847 |
10 | 40634025137611 |
11 | 11a4687a955104 |
12 | 4683190977637 |
13 | 1989a064a0499 |
14 | a069a95c2ba3 |
15 | 4a6eb6c51d41 |
hex | 24f4d8a255cb |
40634025137611 has 2 divisors, whose sum is σ = 40634025137612. Its totient is φ = 40634025137610.
The previous prime is 40634025137593. The next prime is 40634025137659. The reversal of 40634025137611 is 11673152043604.
It is a happy number.
40634025137611 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40634025137611 is a prime.
It is a super-2 number, since 2×406340251376112 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40634025137011) 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, 20317012568805 + 20317012568806.
It is an arithmetic number, because the mean of its divisors is an integer number (20317012568806).
Almost surely, 240634025137611 is an apocalyptic number.
40634025137611 is a deficient number, since it is larger than the sum of its proper divisors (1).
40634025137611 is an equidigital number, since it uses as much as digits as its factorization.
40634025137611 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 43.
The spelling of 40634025137611 in words is "forty trillion, six hundred thirty-four billion, twenty-five million, one hundred thirty-seven thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •