Base | Representation |
---|---|
bin | 10000110000000… |
… | …01101100011100 |
3 | 100210101221212220 |
4 | 20120001230130 |
5 | 241433003444 |
6 | 21535425340 |
7 | 3324240000 |
oct | 1030015434 |
9 | 323357786 |
10 | 140516124 |
11 | 72354931 |
12 | 3b085250 |
13 | 2315b248 |
14 | 1493a700 |
15 | c509619 |
hex | 8601b1c |
140516124 has 60 divisors (see below), whose sum is σ = 382571784. Its totient is φ = 40139232.
The previous prime is 140516119. The next prime is 140516141. The reversal of 140516124 is 421615041.
It is a happy number.
It is a super-2 number, since 2×1405161242 = 39489562207966752, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 140516094 and 140516103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 26374 + ... + 31250.
Almost surely, 2140516124 is an apocalyptic number.
140516124 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 140516124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (191285892).
140516124 is an abundant number, since it is smaller than the sum of its proper divisors (242055660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140516124 is an equidigital number, since it uses as much as digits as its factorization.
140516124 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4912 (or 4889 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
The square root of 140516124 is about 11853.9497215063. The cubic root of 140516124 is about 519.8867159536.
The spelling of 140516124 in words is "one hundred forty million, five hundred sixteen thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •