Base | Representation |
---|---|
bin | 10000000011011… |
… | …00111101101101 |
3 | 100101101122100020 |
4 | 20001230331231 |
5 | 233433222140 |
6 | 21210152353 |
7 | 3223424355 |
oct | 1001547555 |
9 | 311348306 |
10 | 134664045 |
11 | 6a0180aa |
12 | 391226b9 |
13 | 21b8c689 |
14 | 13c55b65 |
15 | bc506d0 |
hex | 806cf6d |
134664045 has 8 divisors (see below), whose sum is σ = 215462496. Its totient is φ = 71820816.
The previous prime is 134664041. The next prime is 134664059. The reversal of 134664045 is 540466431.
134664045 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 134664045 - 22 = 134664041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 134663997 and 134664015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134664041) 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, 4488787 + ... + 4488816.
It is an arithmetic number, because the mean of its divisors is an integer number (26932812).
Almost surely, 2134664045 is an apocalyptic number.
134664045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
134664045 is a deficient number, since it is larger than the sum of its proper divisors (80798451).
134664045 is an equidigital number, since it uses as much as digits as its factorization.
134664045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8977611.
The product of its (nonzero) digits is 34560, while the sum is 33.
The square root of 134664045 is about 11604.4838316920. The cubic root of 134664045 is about 512.5668935091.
The spelling of 134664045 in words is "one hundred thirty-four million, six hundred sixty-four thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •