Base | Representation |
---|---|
bin | 111110011101111011… |
… | …0010000011100010000 |
3 | 110211021000020210010100 |
4 | 1330323312100130100 |
5 | 4144213401040130 |
6 | 141343214332400 |
7 | 12456212511303 |
oct | 1747366203420 |
9 | 424230223110 |
10 | 134148065040 |
11 | 5198a0a3860 |
12 | 21bb9aba100 |
13 | c85b3984a2 |
14 | 66c8362b3a |
15 | 37520d4c60 |
hex | 1f3bd90710 |
134148065040 has 120 divisors (see below), whose sum is σ = 491469758208. Its totient is φ = 32520741120.
The previous prime is 134148065039. The next prime is 134148065081. The reversal of 134148065040 is 40560841431.
134148065040 is a `hidden beast` number, since 1 + 3 + 4 + 148 + 0 + 6 + 504 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 134148064986 and 134148065004.
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, 8461024 + ... + 8476863.
Almost surely, 2134148065040 is an apocalyptic number.
134148065040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
134148065040 is an abundant number, since it is smaller than the sum of its proper divisors (357321693168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134148065040 is a wasteful number, since it uses less digits than its factorization.
134148065040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16937917 (or 16937908 counting only the distinct ones).
The product of its (nonzero) digits is 46080, while the sum is 36.
The spelling of 134148065040 in words is "one hundred thirty-four billion, one hundred forty-eight million, sixty-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •