Base | Representation |
---|---|
bin | 10010010011001000111011… |
… | …01011101111001101001101 |
3 | 12021110220121000221210220201 |
4 | 21021210131223233031031 |
5 | 20233243103412213122 |
6 | 221330004444013501 |
7 | 11322150603351433 |
oct | 1111443553571515 |
9 | 167426530853821 |
10 | 40240046601037 |
11 | 11904787283368 |
12 | 461a95a231291 |
13 | 195b80a50446a |
14 | 9d18b3018d53 |
15 | 49bb08cd0a27 |
hex | 24991daef34d |
40240046601037 has 2 divisors, whose sum is σ = 40240046601038. Its totient is φ = 40240046601036.
The previous prime is 40240046601023. The next prime is 40240046601077. The reversal of 40240046601037 is 73010664004204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23438950621641 + 16801095979396 = 4841379^2 + 4098914^2 .
It is a cyclic number.
It is not a de Polignac number, because 40240046601037 - 215 = 40240046568269 is a prime.
It is a super-2 number, since 2×402400466010372 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 40240046600987 and 40240046601005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40240046601077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20120023300518 + 20120023300519.
It is an arithmetic number, because the mean of its divisors is an integer number (20120023300519).
Almost surely, 240240046601037 is an apocalyptic number.
It is an amenable number.
40240046601037 is a deficient number, since it is larger than the sum of its proper divisors (1).
40240046601037 is an equidigital number, since it uses as much as digits as its factorization.
40240046601037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 37.
The spelling of 40240046601037 in words is "forty trillion, two hundred forty billion, forty-six million, six hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •