Base | Representation |
---|---|
bin | 10000000011010… |
… | …00111101011011 |
3 | 100101100210211202 |
4 | 20001220331123 |
5 | 233432211033 |
6 | 21205544415 |
7 | 3223325504 |
oct | 1001507533 |
9 | 311323752 |
10 | 134647643 |
11 | 6a006849 |
12 | 3911510b |
13 | 21b85080 |
14 | 13c4dbab |
15 | bc4a8e8 |
hex | 8068f5b |
134647643 has 8 divisors (see below), whose sum is σ = 145270608. Its totient is φ = 124062624.
The previous prime is 134647631. The next prime is 134647657. The reversal of 134647643 is 346746431.
It is a happy number.
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 134647643 - 24 = 134647627 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 134647597 and 134647606.
It is not an unprimeable number, because it can be changed into a prime (134647673) 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 7 ways as a sum of consecutive naturals, for example, 1880 + ... + 16517.
It is an arithmetic number, because the mean of its divisors is an integer number (18158826).
Almost surely, 2134647643 is an apocalyptic number.
134647643 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
134647643 is a deficient number, since it is larger than the sum of its proper divisors (10622965).
134647643 is a wasteful number, since it uses less digits than its factorization.
134647643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18973.
The product of its digits is 145152, while the sum is 38.
The square root of 134647643 is about 11603.7771005824. Note that the first 3 decimals coincide. The cubic root of 134647643 is about 512.5460825507.
The spelling of 134647643 in words is "one hundred thirty-four million, six hundred forty-seven thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •