Base | Representation |
---|---|
bin | 100101110011110000… |
… | …111111001110000001 |
3 | 10212210021021120220021 |
4 | 211303300333032001 |
5 | 1131120303133421 |
6 | 30352221013441 |
7 | 2635013121544 |
oct | 456360771601 |
9 | 125707246807 |
10 | 40596927361 |
11 | 162429a8441 |
12 | 7a4b9b4281 |
13 | 3a9c943713 |
14 | 1d7199485b |
15 | 10c90e9341 |
hex | 973c3f381 |
40596927361 has 8 divisors (see below), whose sum is σ = 41696804160. Its totient is φ = 39497190768.
The previous prime is 40596927347. The next prime is 40596927409. The reversal of 40596927361 is 16372969504.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40596927361 - 213 = 40596919169 is a prime.
It is a super-2 number, since 2×405969273612 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40596927299 and 40596927308.
It is not an unprimeable number, because it can be changed into a prime (40596927661) 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 in 7 ways as a sum of consecutive naturals, for example, 850980 + ... + 897418.
It is an arithmetic number, because the mean of its divisors is an integer number (5212100520).
Almost surely, 240596927361 is an apocalyptic number.
It is an amenable number.
40596927361 is a deficient number, since it is larger than the sum of its proper divisors (1099876799).
40596927361 is a wasteful number, since it uses less digits than its factorization.
40596927361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70103.
The product of its (nonzero) digits is 2449440, while the sum is 52.
The spelling of 40596927361 in words is "forty billion, five hundred ninety-six million, nine hundred twenty-seven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •