Base | Representation |
---|---|
bin | 1111111110011… |
… | …11100000111111 |
3 | 100100011212200200 |
4 | 13333033200333 |
5 | 233302103020 |
6 | 21144254543 |
7 | 3215100225 |
oct | 777174077 |
9 | 310155620 |
10 | 134019135 |
11 | 69717618 |
12 | 38a71453 |
13 | 219c4c83 |
14 | 13b28b15 |
15 | bb74590 |
hex | 7fcf83f |
134019135 has 24 divisors (see below), whose sum is σ = 236112864. Its totient is φ = 70303680.
The previous prime is 134019131. The next prime is 134019173. The reversal of 134019135 is 531910431.
It is not a de Polignac number, because 134019135 - 22 = 134019131 is a prime.
It is a super-2 number, since 2×1340191352 = 35922257092296450, which contains 22 as substring.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 134019099 and 134019108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134019131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21667 + ... + 27156.
It is an arithmetic number, because the mean of its divisors is an integer number (9838036).
Almost surely, 2134019135 is an apocalyptic number.
134019135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
134019135 is a deficient number, since it is larger than the sum of its proper divisors (102093729).
134019135 is a wasteful number, since it uses less digits than its factorization.
134019135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48895 (or 48892 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 134019135 is about 11576.6633794025. The cubic root of 134019135 is about 511.7473512918.
Adding to 134019135 its reverse (531910431), we get a palindrome (665929566).
The spelling of 134019135 in words is "one hundred thirty-four million, nineteen thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •