Base | Representation |
---|---|
bin | 10000000000111… |
… | …00011100110101 |
3 | 100100202212222000 |
4 | 20000130130311 |
5 | 233342144021 |
6 | 21155125513 |
7 | 3220552035 |
oct | 1000343465 |
9 | 310685860 |
10 | 134334261 |
11 | 69912356 |
12 | 38ba3899 |
13 | 21aa5539 |
14 | 13bab8c5 |
15 | bbd7b26 |
hex | 801c735 |
134334261 has 16 divisors (see below), whose sum is σ = 202278720. Its totient is φ = 88086960.
The previous prime is 134334257. The next prime is 134334269. The reversal of 134334261 is 162433431.
It is not a de Polignac number, because 134334261 - 22 = 134334257 is a prime.
It is a super-2 number, since 2×1343342612 = 36091387356832242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134334269) 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 15 ways as a sum of consecutive naturals, for example, 39135 + ... + 42428.
It is an arithmetic number, because the mean of its divisors is an integer number (12642420).
Almost surely, 2134334261 is an apocalyptic number.
It is an amenable number.
134334261 is a deficient number, since it is larger than the sum of its proper divisors (67944459).
134334261 is an equidigital number, since it uses as much as digits as its factorization.
134334261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81633 (or 81627 counting only the distinct ones).
The product of its digits is 5184, while the sum is 27.
The square root of 134334261 is about 11590.2657864261. The cubic root of 134334261 is about 512.1481365078.
Adding to 134334261 its reverse (162433431), we get a palindrome (296767692).
The spelling of 134334261 in words is "one hundred thirty-four million, three hundred thirty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •