Base | Representation |
---|---|
bin | 10000000101110… |
… | …00000001100101 |
3 | 100101222021002012 |
4 | 20002320001211 |
5 | 234023041433 |
6 | 21220524005 |
7 | 3226144616 |
oct | 1002700145 |
9 | 311867065 |
10 | 134971493 |
11 | 6a208098 |
12 | 39250605 |
13 | 21c695b7 |
14 | 13cd5c0d |
15 | bcb1848 |
hex | 80b8065 |
134971493 has 4 divisors (see below), whose sum is σ = 135023040. Its totient is φ = 134919948.
The previous prime is 134971457. The next prime is 134971537. The reversal of 134971493 is 394179431.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 394179431 = 557 ⋅707683.
It is a cyclic number.
It is not a de Polignac number, because 134971493 - 218 = 134709349 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134971493.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134941493) 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, 21623 + ... + 27156.
It is an arithmetic number, because the mean of its divisors is an integer number (33755760).
Almost surely, 2134971493 is an apocalyptic number.
It is an amenable number.
134971493 is a deficient number, since it is larger than the sum of its proper divisors (51547).
134971493 is an equidigital number, since it uses as much as digits as its factorization.
134971493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51546.
The product of its digits is 81648, while the sum is 41.
The square root of 134971493 is about 11617.7232278962. The cubic root of 134971493 is about 512.9566731024.
The spelling of 134971493 in words is "one hundred thirty-four million, nine hundred seventy-one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •