Base | Representation |
---|---|
bin | 10000000011110… |
… | …00101111001101 |
3 | 100101111002111022 |
4 | 20001320233031 |
5 | 233441243034 |
6 | 21211203525 |
7 | 3224015066 |
oct | 1001705715 |
9 | 311432438 |
10 | 134712269 |
11 | 6a05035a |
12 | 391465a5 |
13 | 21ba8603 |
14 | 13c6956d |
15 | bc5eb2e |
hex | 8078bcd |
134712269 has 4 divisors (see below), whose sum is σ = 136225980. Its totient is φ = 133198560.
The previous prime is 134712257. The next prime is 134712283. The reversal of 134712269 is 962217431.
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 85192900 + 49519369 = 9230^2 + 7037^2 .
It is a cyclic number.
It is not a de Polignac number, because 134712269 - 28 = 134712013 is a prime.
It is a super-2 number, since 2×1347122692 = 36294790838256722, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134712239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 756722 + ... + 756899.
It is an arithmetic number, because the mean of its divisors is an integer number (34056495).
Almost surely, 2134712269 is an apocalyptic number.
It is an amenable number.
134712269 is a deficient number, since it is larger than the sum of its proper divisors (1513711).
134712269 is an equidigital number, since it uses as much as digits as its factorization.
134712269 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1513710.
The product of its digits is 18144, while the sum is 35.
The square root of 134712269 is about 11606.5614632414. The cubic root of 134712269 is about 512.6280706306.
The spelling of 134712269 in words is "one hundred thirty-four million, seven hundred twelve thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •