Base | Representation |
---|---|
bin | 1000001000000… |
… | …1101011100101 |
3 | 2101010201122211 |
4 | 2002001223211 |
5 | 32211214410 |
6 | 3214323421 |
7 | 562502641 |
oct | 202015345 |
9 | 71121584 |
10 | 34085605 |
11 | 18271024 |
12 | b4b9571 |
13 | 70a57c8 |
14 | 4753c21 |
15 | 2ed468a |
hex | 2081ae5 |
34085605 has 4 divisors (see below), whose sum is σ = 40902732. Its totient is φ = 27268480.
The previous prime is 34085603. The next prime is 34085699. The reversal of 34085605 is 50658043.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 50658043 = 2029 ⋅24967.
It can be written as a sum of positive squares in 2 ways, for example, as 24611521 + 9474084 = 4961^2 + 3078^2 .
It is not a de Polignac number, because 34085605 - 21 = 34085603 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34085603) 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, 3408556 + ... + 3408565.
It is an arithmetic number, because the mean of its divisors is an integer number (10225683).
Almost surely, 234085605 is an apocalyptic number.
It is an amenable number.
34085605 is a deficient number, since it is larger than the sum of its proper divisors (6817127).
34085605 is an equidigital number, since it uses as much as digits as its factorization.
34085605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6817126.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 34085605 is about 5838.2878483336. The cubic root of 34085605 is about 324.2328414440.
The spelling of 34085605 in words is "thirty-four million, eighty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •