Base | Representation |
---|---|
bin | 10000000011101… |
… | …01100000100000 |
3 | 100101110102100100 |
4 | 20001311200200 |
5 | 233440332130 |
6 | 21211022400 |
7 | 3223631400 |
oct | 1001654040 |
9 | 311412310 |
10 | 134699040 |
11 | 6a041423 |
12 | 3913aa00 |
13 | 21ba2598 |
14 | 13c64800 |
15 | bc5ac60 |
hex | 8075820 |
134699040 has 432 divisors, whose sum is σ = 564677568. Its totient is φ = 29094912.
The previous prime is 134699021. The next prime is 134699069. The reversal of 134699040 is 40996431.
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 = 134698986 and 134699004.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1622839 + ... + 1622921.
It is an arithmetic number, because the mean of its divisors is an integer number (1307124).
Almost surely, 2134699040 is an apocalyptic number.
134699040 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 134699040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (282338784).
134699040 is an abundant number, since it is smaller than the sum of its proper divisors (429978528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
134699040 is a wasteful number, since it uses less digits than its factorization.
134699040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 141 (or 123 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 36.
The square root of 134699040 is about 11605.9915560886. The cubic root of 134699040 is about 512.6112897321.
The spelling of 134699040 in words is "one hundred thirty-four million, six hundred ninety-nine thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •