Base | Representation |
---|---|
bin | 100101101110111011… |
… | …011000001100110001 |
3 | 10212120121120010010102 |
4 | 211232323120030301 |
5 | 1130434013440131 |
6 | 30340201242145 |
7 | 2633006214653 |
oct | 455673301461 |
9 | 125517503112 |
10 | 40515765041 |
11 | 16201102a44 |
12 | 7a28793355 |
13 | 3a88b9728b |
14 | 1d64ca86d3 |
15 | 10c1e161cb |
hex | 96eed8331 |
40515765041 has 4 divisors (see below), whose sum is σ = 41280213492. Its totient is φ = 39751316592.
The previous prime is 40515765013. The next prime is 40515765047. The reversal of 40515765041 is 14056751504.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 31327584016 + 9188181025 = 176996^2 + 95855^2 .
It is a cyclic number.
It is not a de Polignac number, because 40515765041 - 210 = 40515764017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40515764986 and 40515765004.
It is not an unprimeable number, because it can be changed into a prime (40515765047) 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 3 ways as a sum of consecutive naturals, for example, 382224146 + ... + 382224251.
It is an arithmetic number, because the mean of its divisors is an integer number (10320053373).
Almost surely, 240515765041 is an apocalyptic number.
It is an amenable number.
40515765041 is a deficient number, since it is larger than the sum of its proper divisors (764448451).
40515765041 is an equidigital number, since it uses as much as digits as its factorization.
40515765041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 764448450.
The product of its (nonzero) digits is 84000, while the sum is 38.
The spelling of 40515765041 in words is "forty billion, five hundred fifteen million, seven hundred sixty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •