Base | Representation |
---|---|
bin | 10010011110100110000000… |
… | …01001110000100111001001 |
3 | 12022212112110110012201102011 |
4 | 21033103000021300213021 |
5 | 20311220120241412131 |
6 | 222230454051535521 |
7 | 11362452562443511 |
oct | 1117230011604711 |
9 | 168775413181364 |
10 | 40633614404041 |
11 | 11a4668a01897a |
12 | 46830972ba5a1 |
13 | 198996c371479 |
14 | a0696ac26841 |
15 | 4a6e90b6d0b1 |
hex | 24f4c02709c9 |
40633614404041 has 2 divisors, whose sum is σ = 40633614404042. Its totient is φ = 40633614404040.
The previous prime is 40633614403997. The next prime is 40633614404069. The reversal of 40633614404041 is 14040441633604.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 35675773326400 + 4957841077641 = 5972920^2 + 2226621^2 .
It is a cyclic number.
It is not a de Polignac number, because 40633614404041 - 27 = 40633614403913 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 40633614403985 and 40633614404003.
It is not a weakly prime, because it can be changed into another prime (40633614444041) 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, 20316807202020 + 20316807202021.
It is an arithmetic number, because the mean of its divisors is an integer number (20316807202021).
Almost surely, 240633614404041 is an apocalyptic number.
It is an amenable number.
40633614404041 is a deficient number, since it is larger than the sum of its proper divisors (1).
40633614404041 is an equidigital number, since it uses as much as digits as its factorization.
40633614404041 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 40.
The spelling of 40633614404041 in words is "forty trillion, six hundred thirty-three billion, six hundred fourteen million, four hundred four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •