Base | Representation |
---|---|
bin | 10000000101011… |
… | …10110001100111 |
3 | 100101220100010000 |
4 | 20002232301213 |
5 | 234020333412 |
6 | 21220032343 |
7 | 3225626304 |
oct | 1002566147 |
9 | 311810100 |
10 | 134933607 |
11 | 6a191686 |
12 | 392326b3 |
13 | 21c55293 |
14 | 13cc60ab |
15 | bca54dc |
hex | 80aec67 |
134933607 has 80 divisors (see below), whose sum is σ = 229996800. Its totient is φ = 78382080.
The previous prime is 134933593. The next prime is 134933609. The reversal of 134933607 is 706339431.
134933607 is a `hidden beast` number, since 1 + 3 + 49 + 3 + 3 + 607 = 666.
It is not a de Polignac number, because 134933607 - 26 = 134933543 is a prime.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134933609) by changing a digit.
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 79 ways as a sum of consecutive naturals, for example, 1237869 + ... + 1237977.
It is an arithmetic number, because the mean of its divisors is an integer number (2874960).
Almost surely, 2134933607 is an apocalyptic number.
134933607 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
134933607 is a deficient number, since it is larger than the sum of its proper divisors (95063193).
134933607 is a wasteful number, since it uses less digits than its factorization.
134933607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198 (or 189 counting only the distinct ones).
The product of its (nonzero) digits is 40824, while the sum is 36.
The square root of 134933607 is about 11616.0925874409. The cubic root of 134933607 is about 512.9086735959.
The spelling of 134933607 in words is "one hundred thirty-four million, nine hundred thirty-three thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •