Base | Representation |
---|---|
bin | 10000000000111… |
… | …00001001011011 |
3 | 100100202211021000 |
4 | 20000130021123 |
5 | 233342124034 |
6 | 21155120043 |
7 | 3220545312 |
oct | 1000341133 |
9 | 310684230 |
10 | 134333019 |
11 | 69911427 |
12 | 38ba3023 |
13 | 21aa4ac2 |
14 | 13bab279 |
15 | bbd7599 |
hex | 801c25b |
134333019 has 8 divisors (see below), whose sum is σ = 199011920. Its totient is φ = 89555328.
The previous prime is 134333011. The next prime is 134333039. The reversal of 134333019 is 910333431.
It is not a de Polignac number, because 134333019 - 23 = 134333011 is a prime.
It is a super-2 number, since 2×1343330192 = 36090719987308722, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 4975297 = 134333019 / (1 + 3 + 4 + 3 + 3 + 3 + 0 + 1 + 9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134332983 and 134333001.
It is not an unprimeable number, because it can be changed into a prime (134333011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2487622 + ... + 2487675.
It is an arithmetic number, because the mean of its divisors is an integer number (24876490).
Almost surely, 2134333019 is an apocalyptic number.
134333019 is a deficient number, since it is larger than the sum of its proper divisors (64678901).
134333019 is an equidigital number, since it uses as much as digits as its factorization.
134333019 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4975306 (or 4975300 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 27.
The square root of 134333019 is about 11590.2122068580. The cubic root of 134333019 is about 512.1465581318.
The spelling of 134333019 in words is "one hundred thirty-four million, three hundred thirty-three thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.086 sec. • engine limits •