Base | Representation |
---|---|
bin | 10010100000010101100010… |
… | …11100110001011010011001 |
3 | 12100002021000210101121011012 |
4 | 21100022301130301122121 |
5 | 20313210240300200321 |
6 | 222314200133343305 |
7 | 11400002540433332 |
oct | 1120126134613231 |
9 | 170067023347135 |
10 | 40693497271961 |
11 | 11a6a019372966 |
12 | 4692809a97b35 |
13 | 19924c3769c21 |
14 | a0980bd09289 |
15 | 4a87e7e8505b |
hex | 2502b1731699 |
40693497271961 has 2 divisors, whose sum is σ = 40693497271962. Its totient is φ = 40693497271960.
The previous prime is 40693497271919. The next prime is 40693497271993. The reversal of 40693497271961 is 16917279439604.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29872029111961 + 10821468160000 = 5465531^2 + 3289600^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40693497271961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40693497271891 and 40693497271900.
It is not a weakly prime, because it can be changed into another prime (40693497271561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20346748635980 + 20346748635981.
It is an arithmetic number, because the mean of its divisors is an integer number (20346748635981).
Almost surely, 240693497271961 is an apocalyptic number.
It is an amenable number.
40693497271961 is a deficient number, since it is larger than the sum of its proper divisors (1).
40693497271961 is an equidigital number, since it uses as much as digits as its factorization.
40693497271961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 123451776, while the sum is 68.
The spelling of 40693497271961 in words is "forty trillion, six hundred ninety-three billion, four hundred ninety-seven million, two hundred seventy-one thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •