Base | Representation |
---|---|
bin | 10010001101101011011010… |
… | …11000011000001001101101 |
3 | 12020210222020222110001200022 |
4 | 21012311231120120021231 |
5 | 20222204311204022000 |
6 | 221103453152211525 |
7 | 11302455636310445 |
oct | 1106655530301155 |
9 | 166728228401608 |
10 | 40052405142125 |
11 | 118421475a1a92 |
12 | 45aa511539ba5 |
13 | 1946c057037bc |
14 | 9c6792407125 |
15 | 496cc5801585 |
hex | 246d6d61826d |
40052405142125 has 16 divisors (see below), whose sum is σ = 51147852824640. Its totient is φ = 31296763083600.
The previous prime is 40052405142121. The next prime is 40052405142163. The reversal of 40052405142125 is 52124150425004.
It is not a de Polignac number, because 40052405142125 - 22 = 40052405142121 is a prime.
It is a super-2 number, since 2×400524051421252 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40052405142121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3725799755 + ... + 3725810504.
It is an arithmetic number, because the mean of its divisors is an integer number (3196740801540).
Almost surely, 240052405142125 is an apocalyptic number.
It is an amenable number.
40052405142125 is a deficient number, since it is larger than the sum of its proper divisors (11095447682515).
40052405142125 is an equidigital number, since it uses as much as digits as its factorization.
40052405142125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7451610317 (or 7451610307 counting only the distinct ones).
The product of its (nonzero) digits is 64000, while the sum is 35.
Adding to 40052405142125 its reverse (52124150425004), we get a palindrome (92176555567129).
The spelling of 40052405142125 in words is "forty trillion, fifty-two billion, four hundred five million, one hundred forty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •