Base | Representation |
---|---|
bin | 1100011001111100… |
… | …1100101111110001 |
3 | 22121002002221202011 |
4 | 3012133030233301 |
5 | 23304444124231 |
6 | 1310234522521 |
7 | 145344051301 |
oct | 30637145761 |
9 | 8532087664 |
10 | 3330067441 |
11 | 1459810a58 |
12 | 78b296441 |
13 | 410babc0c |
14 | 2383a5601 |
15 | 1475419b1 |
hex | c67ccbf1 |
3330067441 has 2 divisors, whose sum is σ = 3330067442. Its totient is φ = 3330067440.
The previous prime is 3330067421. The next prime is 3330067459. The reversal of 3330067441 is 1447600333.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1953286416 + 1376781025 = 44196^2 + 37105^2 .
It is a cyclic number.
It is not a de Polignac number, because 3330067441 - 27 = 3330067313 is a prime.
It is a super-2 number, since 2×33300674412 = 22178698323216576962, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3330067421) 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 as a sum of consecutive naturals, namely, 1665033720 + 1665033721.
It is an arithmetic number, because the mean of its divisors is an integer number (1665033721).
Almost surely, 23330067441 is an apocalyptic number.
It is an amenable number.
3330067441 is a deficient number, since it is larger than the sum of its proper divisors (1).
3330067441 is an equidigital number, since it uses as much as digits as its factorization.
3330067441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18144, while the sum is 31.
The square root of 3330067441 is about 57706.7365304953. The cubic root of 3330067441 is about 1493.3135632558.
Adding to 3330067441 its reverse (1447600333), we get a palindrome (4777667774).
The spelling of 3330067441 in words is "three billion, three hundred thirty million, sixty-seven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •