Base | Representation |
---|---|
bin | 10000000011111… |
… | …11111010100000 |
3 | 100101112120211000 |
4 | 20001333322200 |
5 | 233443213124 |
6 | 21211552000 |
7 | 3224166561 |
oct | 1001777240 |
9 | 311476730 |
10 | 134741664 |
11 | 6a070452 |
12 | 3915b600 |
13 | 21bb8ac5 |
14 | 13c76168 |
15 | bc686c9 |
hex | 807fea0 |
134741664 has 96 divisors (see below), whose sum is σ = 395115840. Its totient is φ = 44672256.
The previous prime is 134741653. The next prime is 134741671. The reversal of 134741664 is 466147431.
It is a tau number, because it is divible by the number of its divisors (96).
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 (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 239047 + ... + 239609.
It is an arithmetic number, because the mean of its divisors is an integer number (4115790).
Almost surely, 2134741664 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 134741664, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (197557920).
134741664 is an abundant number, since it is smaller than the sum of its proper divisors (260374176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134741664 is a wasteful number, since it uses less digits than its factorization.
134741664 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 859 (or 845 counting only the distinct ones).
The product of its digits is 48384, while the sum is 36.
The square root of 134741664 is about 11607.8277037523. The cubic root of 134741664 is about 512.6653540603.
The spelling of 134741664 in words is "one hundred thirty-four million, seven hundred forty-one thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •