Base | Representation |
---|---|
bin | 10000101101011… |
… | …00001111000000 |
3 | 100202202011201022 |
4 | 20112230033000 |
5 | 241340303310 |
6 | 21524125012 |
7 | 3321251315 |
oct | 1026541700 |
9 | 322664638 |
10 | 140166080 |
11 | 7213593a |
12 | 3ab36768 |
13 | 23067b12 |
14 | 14888d0c |
15 | c48aa55 |
hex | 85ac3c0 |
140166080 has 56 divisors (see below), whose sum is σ = 334780128. Its totient is φ = 55897088.
The previous prime is 140166073. The next prime is 140166109. The reversal of 140166080 is 80661041.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 206702 + ... + 207378.
Almost surely, 2140166080 is an apocalyptic number.
140166080 is a gapful number since it is divisible by the number (10) 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 140166080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167390064).
140166080 is an abundant number, since it is smaller than the sum of its proper divisors (194614048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
140166080 is an equidigital number, since it uses as much as digits as its factorization.
140166080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1341 (or 1331 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 26.
The square root of 140166080 is about 11839.1756469781. The cubic root of 140166080 is about 519.4546550993.
It can be divided in two parts, 1401660 and 80, that multiplied together give a triangular number (112132800 = T14975).
The spelling of 140166080 in words is "one hundred forty million, one hundred sixty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.263 sec. • engine limits •