Base | Representation |
---|---|
bin | 10000110000000… |
… | …11101001011101 |
3 | 100210102100212020 |
4 | 20120003221131 |
5 | 241433233000 |
6 | 21535530353 |
7 | 3324302220 |
oct | 1030035135 |
9 | 323370766 |
10 | 140524125 |
11 | 7235a945 |
12 | 3b0899b9 |
13 | 23161a91 |
14 | 1493d5b7 |
15 | c50bba0 |
hex | 8603a5d |
140524125 has 128 divisors (see below), whose sum is σ = 293289984. Its totient is φ = 58291200.
The previous prime is 140524121. The next prime is 140524141. The reversal of 140524125 is 521425041.
It is not a de Polignac number, because 140524125 - 22 = 140524121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140524095 and 140524104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (140524121) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2097342 + ... + 2097408.
It is an arithmetic number, because the mean of its divisors is an integer number (2291328).
Almost surely, 2140524125 is an apocalyptic number.
140524125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
140524125 is an abundant number, since it is smaller than the sum of its proper divisors (152765859).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140524125 is a wasteful number, since it uses less digits than its factorization.
140524125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156 (or 146 counting only the distinct ones).
The product of its (nonzero) digits is 1600, while the sum is 24.
The square root of 140524125 is about 11854.2871991529. The cubic root of 140524125 is about 519.8965832308.
Adding to 140524125 its reverse (521425041), we get a palindrome (661949166).
The spelling of 140524125 in words is "one hundred forty million, five hundred twenty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •