Base | Representation |
---|---|
bin | 100101110000001101… |
… | …111100101011001101 |
3 | 10212122010021210202221 |
4 | 211300031330223031 |
5 | 1131010034112003 |
6 | 30342253215341 |
7 | 2633361205354 |
oct | 456015745315 |
9 | 125563253687 |
10 | 40537410253 |
11 | 1621234734a |
12 | 7a33a91551 |
13 | 3a905054b2 |
14 | 1d67b0099b |
15 | 10c3c8e7bd |
hex | 97037cacd |
40537410253 has 8 divisors (see below), whose sum is σ = 41496705536. Its totient is φ = 39578868000.
The previous prime is 40537410227. The next prime is 40537410269. The reversal of 40537410253 is 35201473504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40537410253 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 (40537410203) 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, 78573 + ... + 295378.
It is an arithmetic number, because the mean of its divisors is an integer number (5187088192).
Almost surely, 240537410253 is an apocalyptic number.
40537410253 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
It is an amenable number.
40537410253 is a deficient number, since it is larger than the sum of its proper divisors (959295283).
40537410253 is a wasteful number, since it uses less digits than its factorization.
40537410253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376515.
The product of its (nonzero) digits is 50400, while the sum is 34.
Adding to 40537410253 its reverse (35201473504), we get a palindrome (75738883757).
The spelling of 40537410253 in words is "forty billion, five hundred thirty-seven million, four hundred ten thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •