Base | Representation |
---|---|
bin | 10000110001001… |
… | …01100010010000 |
3 | 100210200102021002 |
4 | 20120211202100 |
5 | 242002203203 |
6 | 21542521132 |
7 | 3325421000 |
oct | 1030454220 |
9 | 323612232 |
10 | 140662928 |
11 | 7244515a |
12 | 3b1361a8 |
13 | 231b0003 |
14 | 14978000 |
15 | c537d88 |
hex | 8625890 |
140662928 has 120 divisors (see below), whose sum is σ = 340156800. Its totient is φ = 56306880.
The previous prime is 140662927. The next prime is 140662943. The reversal of 140662928 is 829266041.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a junction number, because it is equal to n+sod(n) for n = 140662891 and 140662900.
It is not an unprimeable number, because it can be changed into a prime (140662927) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1981133 + ... + 1981203.
It is an arithmetic number, because the mean of its divisors is an integer number (2834640).
Almost surely, 2140662928 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140662928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170078400).
140662928 is an abundant number, since it is smaller than the sum of its proper divisors (199493872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140662928 is an equidigital number, since it uses as much as digits as its factorization.
140662928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138 (or 99 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 38.
The square root of 140662928 is about 11860.1403027114. The cubic root of 140662928 is about 520.0677032163.
The spelling of 140662928 in words is "one hundred forty million, six hundred sixty-two thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •