Base | Representation |
---|---|
bin | 100101010011010000… |
… | …000001000000111101 |
3 | 10211101020210120221122 |
4 | 211103100001000331 |
5 | 1124011130204203 |
6 | 30222132440325 |
7 | 2615340252041 |
oct | 452320010075 |
9 | 124336716848 |
10 | 40051413053 |
11 | 15a92a84473 |
12 | 79191790a5 |
13 | 3a13913ba2 |
14 | 1d1d352021 |
15 | 1096290538 |
hex | 95340103d |
40051413053 has 8 divisors (see below), whose sum is σ = 41489272440. Its totient is φ = 38635505920.
The previous prime is 40051413047. The next prime is 40051413079. The reversal of 40051413053 is 35031415004.
It can be written as a sum of positive squares in 4 ways, for example, as 582836164 + 39468576889 = 24142^2 + 198667^2 .
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 40051413053 - 232 = 35756445757 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40051413013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5484350 + ... + 5491647.
It is an arithmetic number, because the mean of its divisors is an integer number (5186159055).
Almost surely, 240051413053 is an apocalyptic number.
It is an amenable number.
40051413053 is a deficient number, since it is larger than the sum of its proper divisors (1437859387).
40051413053 is a wasteful number, since it uses less digits than its factorization.
40051413053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10976127.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 40051413053 its reverse (35031415004), we get a palindrome (75082828057).
The spelling of 40051413053 in words is "forty billion, fifty-one million, four hundred thirteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •