Base | Representation |
---|---|
bin | 10010010011000001101101… |
… | …10101001100111111000001 |
3 | 12021110112121010010012101222 |
4 | 21021200312311030333001 |
5 | 20233212140411423114 |
6 | 221324124251004425 |
7 | 11321652614051162 |
oct | 1111406665147701 |
9 | 167415533105358 |
10 | 40236173545409 |
11 | 1190307a014346 |
12 | 461a059139715 |
13 | 195b340c9b77a |
14 | 9d16268ab769 |
15 | 49b97dc8398e |
hex | 249836d4cfc1 |
40236173545409 has 2 divisors, whose sum is σ = 40236173545410. Its totient is φ = 40236173545408.
The previous prime is 40236173545313. The next prime is 40236173545411. The reversal of 40236173545409 is 90454537163204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27281191459600 + 12954982085809 = 5223140^2 + 3599303^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40236173545409 is a prime.
It is a super-3 number, since 3×402361735454093 (a number of 42 digits) contains 333 as substring.
Together with 40236173545411, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (40236173545499) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20118086772704 + 20118086772705.
It is an arithmetic number, because the mean of its divisors is an integer number (20118086772705).
Almost surely, 240236173545409 is an apocalyptic number.
It is an amenable number.
40236173545409 is a deficient number, since it is larger than the sum of its proper divisors (1).
40236173545409 is an equidigital number, since it uses as much as digits as its factorization.
40236173545409 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10886400, while the sum is 53.
The spelling of 40236173545409 in words is "forty trillion, two hundred thirty-six billion, one hundred seventy-three million, five hundred forty-five thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •