Base | Representation |
---|---|
bin | 10000000000011… |
… | …01000111100001 |
3 | 100100122200210221 |
4 | 20000031013201 |
5 | 233333141312 |
6 | 21153523041 |
7 | 3220200655 |
oct | 1000150741 |
9 | 310580727 |
10 | 134271457 |
11 | 6987a151 |
12 | 38b73481 |
13 | 21a82a88 |
14 | 13b92a65 |
15 | bbc4207 |
hex | 800d1e1 |
134271457 has 8 divisors (see below), whose sum is σ = 142895016. Its totient is φ = 125728512.
The previous prime is 134271439. The next prime is 134271517. The reversal of 134271457 is 754172431.
It can be written as a sum of positive squares in 4 ways, for example, as 41938576 + 92332881 = 6476^2 + 9609^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 134271457 - 27 = 134271329 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134271407) 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, 16698 + ... + 23395.
It is an arithmetic number, because the mean of its divisors is an integer number (17861877).
Almost surely, 2134271457 is an apocalyptic number.
134271457 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
134271457 is a deficient number, since it is larger than the sum of its proper divisors (8623559).
134271457 is a wasteful number, since it uses less digits than its factorization.
134271457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40307.
The product of its digits is 23520, while the sum is 34.
The square root of 134271457 is about 11587.5561271564. The cubic root of 134271457 is about 512.0683108421.
It can be divided in two parts, 13427 and 1457, that added together give a square (14884 = 1222).
The spelling of 134271457 in words is "one hundred thirty-four million, two hundred seventy-one thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •