Base | Representation |
---|---|
bin | 111110110001001001… |
… | …0110100111100100000 |
3 | 110212220221222101101020 |
4 | 1331202102310330200 |
5 | 4202024012320200 |
6 | 141531215405440 |
7 | 12511204231116 |
oct | 1754222647440 |
9 | 425827871336 |
10 | 134793088800 |
11 | 52190203747 |
12 | 22159b23880 |
13 | c931bc9456 |
14 | 6749ca9ab6 |
15 | 378da47ea0 |
hex | 1f624b4f20 |
134793088800 has 144 divisors (see below), whose sum is σ = 438934531392. Its totient is φ = 35929830400.
The previous prime is 134793088777. The next prime is 134793088811. The reversal of 134793088800 is 8880397431.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors.
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, 6496042 + ... + 6516758.
It is an arithmetic number, because the mean of its divisors is an integer number (3048156468).
Almost surely, 2134793088800 is an apocalyptic number.
134793088800 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 134793088800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219467265696).
134793088800 is an abundant number, since it is smaller than the sum of its proper divisors (304141442592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134793088800 is a wasteful number, since it uses less digits than its factorization.
134793088800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23451 (or 23438 counting only the distinct ones).
The product of its (nonzero) digits is 1161216, while the sum is 51.
The spelling of 134793088800 in words is "one hundred thirty-four billion, seven hundred ninety-three million, eighty-eight thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •