Base | Representation |
---|---|
bin | 111110110001010110… |
… | …1011111111100000000 |
3 | 110212221110010121101021 |
4 | 1331202231133330000 |
5 | 4202032310040030 |
6 | 141532025315224 |
7 | 12511320531361 |
oct | 1754255377400 |
9 | 425843117337 |
10 | 134800080640 |
11 | 52194149825 |
12 | 22160335b14 |
13 | c9334a6a34 |
14 | 674aba9b68 |
15 | 378e47997a |
hex | 1f62b5ff00 |
134800080640 has 72 divisors (see below), whose sum is σ = 323062972848. Its totient is φ = 53890867200.
The previous prime is 134800080637. The next prime is 134800080661. The reversal of 134800080640 is 46080008431.
It is a junction number, because it is equal to n+sod(n) for n = 134800080596 and 134800080605.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2421115 + ... + 2476165.
It is an arithmetic number, because the mean of its divisors is an integer number (4486985734).
Almost surely, 2134800080640 is an apocalyptic number.
134800080640 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 134800080640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161531486424).
134800080640 is an abundant number, since it is smaller than the sum of its proper divisors (188262892208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134800080640 is an equidigital number, since it uses as much as digits as its factorization.
134800080640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56985 (or 56971 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 34.
The spelling of 134800080640 in words is "one hundred thirty-four billion, eight hundred million, eighty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •