Base | Representation |
---|---|
bin | 1100011001000101… |
… | …0000001001110101 |
3 | 22120211020012120112 |
4 | 3012101100021311 |
5 | 23303030131011 |
6 | 1310024312405 |
7 | 145301013236 |
oct | 30621201165 |
9 | 8524205515 |
10 | 3326411381 |
11 | 1457744117 |
12 | 78a012705 |
13 | 4101cba77 |
14 | 237ad308d |
15 | 14706d58b |
hex | c6450275 |
3326411381 has 2 divisors, whose sum is σ = 3326411382. Its totient is φ = 3326411380.
The previous prime is 3326411371. The next prime is 3326411461. The reversal of 3326411381 is 1831146233.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3313844356 + 12567025 = 57566^2 + 3545^2 .
It is a cyclic number.
It is not a de Polignac number, because 3326411381 - 222 = 3322217077 is a prime.
It is a super-2 number, since 2×33264113812 = 22130025351292654322, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3326411371) 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 as a sum of consecutive naturals, namely, 1663205690 + 1663205691.
It is an arithmetic number, because the mean of its divisors is an integer number (1663205691).
Almost surely, 23326411381 is an apocalyptic number.
It is an amenable number.
3326411381 is a deficient number, since it is larger than the sum of its proper divisors (1).
3326411381 is an equidigital number, since it uses as much as digits as its factorization.
3326411381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10368, while the sum is 32.
The square root of 3326411381 is about 57675.0499002818. The cubic root of 3326411381 is about 1492.7668632926.
The spelling of 3326411381 in words is "three billion, three hundred twenty-six million, four hundred eleven thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •