Base | Representation |
---|---|
bin | 1111111111111… |
… | …10011101110001 |
3 | 100100112122111010 |
4 | 13333332131301 |
5 | 233324231231 |
6 | 21152341133 |
7 | 3216531000 |
oct | 777763561 |
9 | 310478433 |
10 | 134211441 |
11 | 69839051 |
12 | 38b447a9 |
13 | 21a61670 |
14 | 13b78c37 |
15 | bbb1546 |
hex | 7ffe771 |
134211441 has 64 divisors (see below), whose sum is σ = 229376000. Its totient is φ = 69346368.
The previous prime is 134211439. The next prime is 134211443. The reversal of 134211441 is 144112431.
It is an interprime number because it is at equal distance from previous prime (134211439) and next prime (134211443).
It is not a de Polignac number, because 134211441 - 21 = 134211439 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (134211443) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1056720 + ... + 1056846.
It is an arithmetic number, because the mean of its divisors is an integer number (3584000).
Almost surely, 2134211441 is an apocalyptic number.
It is an amenable number.
134211441 is a deficient number, since it is larger than the sum of its proper divisors (95164559).
134211441 is a wasteful number, since it uses less digits than its factorization.
134211441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243 (or 229 counting only the distinct ones).
The product of its digits is 384, while the sum is 21.
The square root of 134211441 is about 11584.9661630926. The cubic root of 134211441 is about 511.9920055413.
Adding to 134211441 its reverse (144112431), we get a palindrome (278323872).
It can be divided in two parts, 134 and 211441, that added together give a triangular number (211575 = T650).
The spelling of 134211441 in words is "one hundred thirty-four million, two hundred eleven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •