Base | Representation |
---|---|
bin | 1100101011110100… |
… | …0010111101110101 |
3 | 22210022002221200001 |
4 | 3022331002331311 |
5 | 23433140004230 |
6 | 1321512551301 |
7 | 150244012231 |
oct | 31275027565 |
9 | 8708087601 |
10 | 3405000565 |
11 | 149804135a |
12 | 7b03b2531 |
13 | 423586c45 |
14 | 24430d5c1 |
15 | 14dde40ca |
hex | caf42f75 |
3405000565 has 4 divisors (see below), whose sum is σ = 4086000684. Its totient is φ = 2724000448.
The previous prime is 3405000563. The next prime is 3405000581. The reversal of 3405000565 is 5650005043.
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 514110276 + 2890890289 = 22674^2 + 53767^2 .
It is a cyclic number.
It is not a de Polignac number, because 3405000565 - 21 = 3405000563 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3405000563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 340500052 + ... + 340500061.
It is an arithmetic number, because the mean of its divisors is an integer number (1021500171).
Almost surely, 23405000565 is an apocalyptic number.
It is an amenable number.
3405000565 is a deficient number, since it is larger than the sum of its proper divisors (681000119).
3405000565 is an equidigital number, since it uses as much as digits as its factorization.
3405000565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681000118.
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 3405000565 is about 58352.3826848570. The cubic root of 3405000565 is about 1504.4314235794.
The spelling of 3405000565 in words is "three billion, four hundred five million, five hundred sixty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •