Base | Representation |
---|---|
bin | 100101101111100000… |
… | …000110101101110101 |
3 | 10212121021200020212111 |
4 | 211233200012231311 |
5 | 1130444000032012 |
6 | 30341143451021 |
7 | 2633154104053 |
oct | 455740065565 |
9 | 125537606774 |
10 | 40525392757 |
11 | 16206589433 |
12 | 7a2ba56a71 |
13 | 3a8ab88555 |
14 | 1d662931d3 |
15 | 10c2bb8ba7 |
hex | 96f806b75 |
40525392757 has 2 divisors, whose sum is σ = 40525392758. Its totient is φ = 40525392756.
The previous prime is 40525392737. The next prime is 40525392811. The reversal of 40525392757 is 75729352504.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23288591236 + 17236801521 = 152606^2 + 131289^2 .
It is a cyclic number.
It is not a de Polignac number, because 40525392757 - 27 = 40525392629 is a prime.
It is a super-2 number, since 2×405253927572 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 40525392757.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40525392737) 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, 20262696378 + 20262696379.
It is an arithmetic number, because the mean of its divisors is an integer number (20262696379).
Almost surely, 240525392757 is an apocalyptic number.
It is an amenable number.
40525392757 is a deficient number, since it is larger than the sum of its proper divisors (1).
40525392757 is an equidigital number, since it uses as much as digits as its factorization.
40525392757 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2646000, while the sum is 49.
The spelling of 40525392757 in words is "forty billion, five hundred twenty-five million, three hundred ninety-two thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •