Base | Representation |
---|---|
bin | 1111111111111… |
… | …11001010011101 |
3 | 100100112210102001 |
4 | 13333333022131 |
5 | 233324324201 |
6 | 21152402301 |
7 | 3216542224 |
oct | 777771235 |
9 | 310483361 |
10 | 134214301 |
11 | 69840211 |
12 | 38b46391 |
13 | 21a62a60 |
14 | 13b79cbb |
15 | bbb2301 |
hex | 7fff29d |
134214301 has 4 divisors (see below), whose sum is σ = 144538492. Its totient is φ = 123890112.
The previous prime is 134214277. The next prime is 134214317. The reversal of 134214301 is 103412431.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 103412431 = 257 ⋅402383.
It can be written as a sum of positive squares in 2 ways, for example, as 27815076 + 106399225 = 5274^2 + 10315^2 .
It is a cyclic number.
It is not a de Polignac number, because 134214301 - 27 = 134214173 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 (134212301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5162076 + ... + 5162101.
It is an arithmetic number, because the mean of its divisors is an integer number (36134623).
Almost surely, 2134214301 is an apocalyptic number.
It is an amenable number.
134214301 is a deficient number, since it is larger than the sum of its proper divisors (10324191).
134214301 is a wasteful number, since it uses less digits than its factorization.
134214301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10324190.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 134214301 is about 11585.0895982724. The cubic root of 134214301 is about 511.9956423071.
Adding to 134214301 its reverse (103412431), we get a palindrome (237626732).
The spelling of 134214301 in words is "one hundred thirty-four million, two hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.215 sec. • engine limits •