Base | Representation |
---|---|
bin | 100101011000100101… |
… | …110101101111011101 |
3 | 10211121111102002202002 |
4 | 211120211311233131 |
5 | 1124202100121000 |
6 | 30235053212045 |
7 | 2620506020123 |
oct | 453045655735 |
9 | 124544362662 |
10 | 40141020125 |
11 | 160296175a8 |
12 | 7943191025 |
13 | 3a2935901b |
14 | 1d2b1d9913 |
15 | 109e0908d5 |
hex | 958975bdd |
40141020125 has 16 divisors (see below), whose sum is σ = 50138170992. Its totient is φ = 32085779200.
The previous prime is 40141020113. The next prime is 40141020191. The reversal of 40141020125 is 52102014104.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 21467524324 + 18673495801 = 146518^2 + 136651^2 .
It is not a de Polignac number, because 40141020125 - 224 = 40124242909 is a prime.
It is a super-2 number, since 2×401410201252 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40141020097 and 40141020106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14537 + ... + 283713.
It is an arithmetic number, because the mean of its divisors is an integer number (3133635687).
Almost surely, 240141020125 is an apocalyptic number.
It is an amenable number.
40141020125 is a deficient number, since it is larger than the sum of its proper divisors (9997150867).
40141020125 is a wasteful number, since it uses less digits than its factorization.
40141020125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270385 (or 270375 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 20.
Adding to 40141020125 its reverse (52102014104), we get a palindrome (92243034229).
The spelling of 40141020125 in words is "forty billion, one hundred forty-one million, twenty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •