Base | Representation |
---|---|
bin | 10000110001001… |
… | …11011000111101 |
3 | 100210200210200110 |
4 | 20120213120331 |
5 | 242002424100 |
6 | 21543020233 |
7 | 3325452102 |
oct | 1030473075 |
9 | 323623613 |
10 | 140670525 |
11 | 7244a936 |
12 | 3b13a679 |
13 | 231b35c8 |
14 | 1497aaa9 |
15 | c53a250 |
hex | 862763d |
140670525 has 24 divisors (see below), whose sum is σ = 235859904. Its totient is φ = 73964800.
The previous prime is 140670493. The next prime is 140670557. The reversal of 140670525 is 525076041.
140670525 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (140670493) and next prime (140670557).
It is not a de Polignac number, because 140670525 - 25 = 140670493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140670492 and 140670501.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7884 + ... + 18533.
It is an arithmetic number, because the mean of its divisors is an integer number (9827496).
Almost surely, 2140670525 is an apocalyptic number.
140670525 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
140670525 is a deficient number, since it is larger than the sum of its proper divisors (95189379).
140670525 is a wasteful number, since it uses less digits than its factorization.
140670525 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26501 (or 26496 counting only the distinct ones).
The product of its (nonzero) digits is 8400, while the sum is 30.
The square root of 140670525 is about 11860.4605728445. The cubic root of 140670525 is about 520.0770657477.
The spelling of 140670525 in words is "one hundred forty million, six hundred seventy thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •