Base | Representation |
---|---|
bin | 1100101100010000… |
… | …1011100010001001 |
3 | 22210102121221222000 |
4 | 3023010023202021 |
5 | 23434124330130 |
6 | 1322021021213 |
7 | 150265631352 |
oct | 31304134211 |
9 | 8712557860 |
10 | 3406870665 |
11 | 14990a93a0 |
12 | 7b0b54809 |
13 | 423a90203 |
14 | 244678d29 |
15 | 14e163260 |
hex | cb10b889 |
3406870665 has 64 divisors (see below), whose sum is σ = 6617445120. Its totient is φ = 1649272320.
The previous prime is 3406870657. The next prime is 3406870667. The reversal of 3406870665 is 5660786043.
It is not a de Polignac number, because 3406870665 - 23 = 3406870657 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3406870665.
It is not an unprimeable number, because it can be changed into a prime (3406870667) 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 63 ways as a sum of consecutive naturals, for example, 1271307 + ... + 1273983.
It is an arithmetic number, because the mean of its divisors is an integer number (103397580).
Almost surely, 23406870665 is an apocalyptic number.
It is an amenable number.
3406870665 is a deficient number, since it is larger than the sum of its proper divisors (3210574455).
3406870665 is a wasteful number, since it uses less digits than its factorization.
3406870665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3559 (or 3553 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 45.
The square root of 3406870665 is about 58368.4046809573. The cubic root of 3406870665 is about 1504.7067952709.
The spelling of 3406870665 in words is "three billion, four hundred six million, eight hundred seventy thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •