Base | Representation |
---|---|
bin | 111110011010011101… |
… | …0100110101011000000 |
3 | 110210221220102002022100 |
4 | 1330310322212223000 |
5 | 4143444112423120 |
6 | 141323501510400 |
7 | 12453301124550 |
oct | 1746472465300 |
9 | 423856362270 |
10 | 134031764160 |
11 | 5192a489228 |
12 | 21b86b72400 |
13 | c8402681b8 |
14 | 66b6b2b160 |
15 | 3746cb0490 |
hex | 1f34ea6ac0 |
134031764160 has 168 divisors, whose sum is σ = 526872561696. Its totient is φ = 30635827200.
The previous prime is 134031764137. The next prime is 134031764227. The reversal of 134031764160 is 61467130431.
134031764160 is a `hidden beast` number, since 1 + 3 + 4 + 0 + 3 + 1 + 7 + 641 + 6 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (168).
It is a Harshad number since it is a multiple of its sum of digits (36).
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 23 ways as a sum of consecutive naturals, for example, 3304041 + ... + 3344360.
Almost surely, 2134031764160 is an apocalyptic number.
134031764160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134031764160 is an abundant number, since it is smaller than the sum of its proper divisors (392840797536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134031764160 is a wasteful number, since it uses less digits than its factorization.
134031764160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6648431 (or 6648418 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
Adding to 134031764160 its reverse (61467130431), we get a palindrome (195498894591).
The spelling of 134031764160 in words is "one hundred thirty-four billion, thirty-one million, seven hundred sixty-four thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •