Base | Representation |
---|---|
bin | 10010010000000110101100… |
… | …00011010111101111110110 |
3 | 12021002221102111220012002121 |
4 | 21020003112003113233312 |
5 | 20230041021444344000 |
6 | 221210041032430154 |
7 | 11311466454556651 |
oct | 1110032603275766 |
9 | 167087374805077 |
10 | 40135765621750 |
11 | 118745343a1157 |
12 | 46026b684835a |
13 | 1951a2bb04ca6 |
14 | 9ca81d5c2898 |
15 | 499053d1cb1a |
hex | 2480d60d7bf6 |
40135765621750 has 32 divisors (see below), whose sum is σ = 75147050111328. Its totient is φ = 16051550508000.
The previous prime is 40135765621747. The next prime is 40135765621759. The reversal of 40135765621750 is 5712656753104.
40135765621750 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×401357656217502 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40135765621759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12319041 + ... + 15232540.
It is an arithmetic number, because the mean of its divisors is an integer number (2348345315979).
Almost surely, 240135765621750 is an apocalyptic number.
40135765621750 is a deficient number, since it is larger than the sum of its proper divisors (35011284489578).
40135765621750 is a wasteful number, since it uses less digits than its factorization.
40135765621750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27557425 (or 27557415 counting only the distinct ones).
The product of its (nonzero) digits is 5292000, while the sum is 52.
The spelling of 40135765621750 in words is "forty trillion, one hundred thirty-five billion, seven hundred sixty-five million, six hundred twenty-one thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •