Base | Representation |
---|---|
bin | 1100110000101110… |
… | …1000110001010101 |
3 | 22211201212122102001 |
4 | 3030023220301111 |
5 | 24003423241040 |
6 | 1323530315301 |
7 | 150614066503 |
oct | 31413506125 |
9 | 8751778361 |
10 | 3425602645 |
11 | 14a8732a73 |
12 | 7b7288b31 |
13 | 42791b41a |
14 | 246d53673 |
15 | 150b1359a |
hex | cc2e8c55 |
3425602645 has 4 divisors (see below), whose sum is σ = 4110723180. Its totient is φ = 2740482112.
The previous prime is 3425602639. The next prime is 3425602651. The reversal of 3425602645 is 5462065243.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (3425602639) and next prime (3425602651).
It can be written as a sum of positive squares in 2 ways, for example, as 2122537041 + 1303065604 = 46071^2 + 36098^2 .
It is a cyclic number.
It is not a de Polignac number, because 3425602645 - 215 = 3425569877 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 342560260 + ... + 342560269.
It is an arithmetic number, because the mean of its divisors is an integer number (1027680795).
Almost surely, 23425602645 is an apocalyptic number.
It is an amenable number.
3425602645 is a deficient number, since it is larger than the sum of its proper divisors (685120535).
3425602645 is an equidigital number, since it uses as much as digits as its factorization.
3425602645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 685120534.
The product of its (nonzero) digits is 172800, while the sum is 37.
The square root of 3425602645 is about 58528.6480708379. The cubic root of 3425602645 is about 1507.4595302600.
Adding to 3425602645 its reverse (5462065243), we get a palindrome (8887667888).
The spelling of 3425602645 in words is "three billion, four hundred twenty-five million, six hundred two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •