Base | Representation |
---|---|
bin | 10000000100011… |
… | …00011110011001 |
3 | 100101122012101112 |
4 | 20002030132121 |
5 | 234001334423 |
6 | 21213030105 |
7 | 3224502560 |
oct | 1002143631 |
9 | 311565345 |
10 | 134793113 |
11 | 6a0a6074 |
12 | 39185335 |
13 | 21c06350 |
14 | 13c8abd7 |
15 | bc78a78 |
hex | 808c799 |
134793113 has 32 divisors (see below), whose sum is σ = 170666496. Its totient is φ = 103638528.
The previous prime is 134793107. The next prime is 134793121. The reversal of 134793113 is 311397431.
It is a happy number.
It is not a de Polignac number, because 134793113 - 24 = 134793097 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 134793113.
It is not an unprimeable number, because it can be changed into a prime (134793193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 684131 + ... + 684327.
It is an arithmetic number, because the mean of its divisors is an integer number (5333328).
Almost surely, 2134793113 is an apocalyptic number.
134793113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
134793113 is a deficient number, since it is larger than the sum of its proper divisors (35873383).
134793113 is a wasteful number, since it uses less digits than its factorization.
134793113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393.
The product of its digits is 6804, while the sum is 32.
The square root of 134793113 is about 11610.0436261024. The cubic root of 134793113 is about 512.7305968432.
The spelling of 134793113 in words is "one hundred thirty-four million, seven hundred ninety-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •