Base | Representation |
---|---|
bin | 1100011000110001… |
… | …1111101100011001 |
3 | 22120201212211220211 |
4 | 3012030133230121 |
5 | 23302220224223 |
6 | 1305541451121 |
7 | 145254300412 |
oct | 30614375431 |
9 | 8521784824 |
10 | 3325164313 |
11 | 1456a72189 |
12 | 789710aa1 |
13 | 40cb83263 |
14 | 23788a809 |
15 | 146dc3d0d |
hex | c631fb19 |
3325164313 has 2 divisors, whose sum is σ = 3325164314. Its totient is φ = 3325164312.
The previous prime is 3325164301. The next prime is 3325164391. The reversal of 3325164313 is 3134615233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3320871129 + 4293184 = 57627^2 + 2072^2 .
It is a cyclic number.
It is not a de Polignac number, because 3325164313 - 25 = 3325164281 is a prime.
It is a super-2 number, since 2×33251643132 = 22113435416897523938, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3325168313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1662582156 + 1662582157.
It is an arithmetic number, because the mean of its divisors is an integer number (1662582157).
Almost surely, 23325164313 is an apocalyptic number.
It is an amenable number.
3325164313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3325164313 is an equidigital number, since it uses as much as digits as its factorization.
3325164313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 19440, while the sum is 31.
The square root of 3325164313 is about 57664.2377301565. The cubic root of 3325164313 is about 1492.5802944194.
Adding to 3325164313 its reverse (3134615233), we get a palindrome (6459779546).
The spelling of 3325164313 in words is "three billion, three hundred twenty-five million, one hundred sixty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •