Base | Representation |
---|---|
bin | 10010100011111000011101… |
… | …00011110000001000001001 |
3 | 12100111220110201110111200202 |
4 | 21101330032203300020021 |
5 | 20322204233011421311 |
6 | 222450144244341545 |
7 | 11411544432500444 |
oct | 1121741643601011 |
9 | 170456421414622 |
10 | 40815318467081 |
11 | 12006752248914 |
12 | 46b23476a48b5 |
13 | 19a0b39055732 |
14 | a1168708465b |
15 | 4aba77c7de3b |
hex | 251f0e8f0209 |
40815318467081 has 2 divisors, whose sum is σ = 40815318467082. Its totient is φ = 40815318467080.
The previous prime is 40815318467069. The next prime is 40815318467111. The reversal of 40815318467081 is 18076481351804.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39667386222025 + 1147932245056 = 6298205^2 + 1071416^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40815318467081 is a prime.
It is a super-2 number, since 2×408153184670812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (40815318467041) 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, 20407659233540 + 20407659233541.
It is an arithmetic number, because the mean of its divisors is an integer number (20407659233541).
Almost surely, 240815318467081 is an apocalyptic number.
It is an amenable number.
40815318467081 is a deficient number, since it is larger than the sum of its proper divisors (1).
40815318467081 is an equidigital number, since it uses as much as digits as its factorization.
40815318467081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5160960, while the sum is 56.
The spelling of 40815318467081 in words is "forty trillion, eight hundred fifteen billion, three hundred eighteen million, four hundred sixty-seven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •