Base | Representation |
---|---|
bin | 111110101101000100… |
… | …1010011101101000100 |
3 | 110212120102201122011010 |
4 | 1331122021103231010 |
5 | 4201234013004440 |
6 | 141505453242220 |
7 | 12504624210324 |
oct | 1753211235504 |
9 | 425512648133 |
10 | 134656375620 |
11 | 52120017048 |
12 | 22120193370 |
13 | c90c7a0190 |
14 | 6735a7d284 |
15 | 3781a40580 |
hex | 1f5a253b44 |
134656375620 has 48 divisors (see below), whose sum is σ = 406040765760. Its totient is φ = 33146184576.
The previous prime is 134656375619. The next prime is 134656375631. The reversal of 134656375620 is 26573656431.
It is a super-2 number, since 2×1346563756202 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 134656375620.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86317410 + ... + 86318969.
It is an arithmetic number, because the mean of its divisors is an integer number (8459182620).
Almost surely, 2134656375620 is an apocalyptic number.
134656375620 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134656375620 is an abundant number, since it is smaller than the sum of its proper divisors (271384390140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134656375620 is a wasteful number, since it uses less digits than its factorization.
134656375620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172636404 (or 172636402 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 48.
The spelling of 134656375620 in words is "one hundred thirty-four billion, six hundred fifty-six million, three hundred seventy-five thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •