Base | Representation |
---|---|
bin | 10010010111111001001110… |
… | …01010011110010000000001 |
3 | 12022001112021102022101121212 |
4 | 21023330213022132100001 |
5 | 20243432143042111431 |
6 | 221533023343055505 |
7 | 11340023163000401 |
oct | 1113744712362001 |
9 | 168045242271555 |
10 | 40403414410241 |
11 | 11967aa0135413 |
12 | 46465518a1595 |
13 | 197104440599c |
14 | 9d976dd1a801 |
15 | 4a0ebb26772b |
hex | 24bf2729e401 |
40403414410241 has 2 divisors, whose sum is σ = 40403414410242. Its totient is φ = 40403414410240.
The previous prime is 40403414410201. The next prime is 40403414410259. The reversal of 40403414410241 is 14201441430404.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 40254202944400 + 149211465841 = 6344620^2 + 386279^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40403414410241 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40403414410198 and 40403414410207.
It is not a weakly prime, because it can be changed into another prime (40403414410201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20201707205120 + 20201707205121.
It is an arithmetic number, because the mean of its divisors is an integer number (20201707205121).
Almost surely, 240403414410241 is an apocalyptic number.
It is an amenable number.
40403414410241 is a deficient number, since it is larger than the sum of its proper divisors (1).
40403414410241 is an equidigital number, since it uses as much as digits as its factorization.
40403414410241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 40403414410241 its reverse (14201441430404), we get a palindrome (54604855840645).
The spelling of 40403414410241 in words is "forty trillion, four hundred three billion, four hundred fourteen million, four hundred ten thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •