Base | Representation |
---|---|
bin | 1111111111010… |
… | …00001110010101 |
3 | 100100101000112001 |
4 | 13333220032111 |
5 | 233313322331 |
6 | 21150355301 |
7 | 3216001255 |
oct | 777501625 |
9 | 310330461 |
10 | 134120341 |
11 | 69786663 |
12 | 38abbb31 |
13 | 21a2c064 |
14 | 13b53965 |
15 | bb94561 |
hex | 7fe8395 |
134120341 has 4 divisors (see below), whose sum is σ = 134419500. Its totient is φ = 133821184.
The previous prime is 134120321. The next prime is 134120359. The reversal of 134120341 is 143021431.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 59367025 + 74753316 = 7705^2 + 8646^2 .
It is a cyclic number.
It is not a de Polignac number, because 134120341 - 25 = 134120309 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134120321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 148906 + ... + 149803.
It is an arithmetic number, because the mean of its divisors is an integer number (33604875).
Almost surely, 2134120341 is an apocalyptic number.
It is an amenable number.
134120341 is a deficient number, since it is larger than the sum of its proper divisors (299159).
134120341 is an equidigital number, since it uses as much as digits as its factorization.
134120341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299158.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 134120341 is about 11581.0336757994. The cubic root of 134120341 is about 511.8761360628.
Adding to 134120341 its reverse (143021431), we get a palindrome (277141772).
The spelling of 134120341 in words is "one hundred thirty-four million, one hundred twenty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •