Base | Representation |
---|---|
bin | 1100010010110111… |
… | …0011000011111001 |
3 | 22112000011122022101 |
4 | 3010231303003321 |
5 | 23224341334321 |
6 | 1303253423401 |
7 | 144533266252 |
oct | 30455630371 |
9 | 8460148271 |
10 | 3300339961 |
11 | 1443a57296 |
12 | 78133ab61 |
13 | 4079a0ca9 |
14 | 234467b29 |
15 | 144b1d791 |
hex | c4b730f9 |
3300339961 has 2 divisors, whose sum is σ = 3300339962. Its totient is φ = 3300339960.
The previous prime is 3300339947. The next prime is 3300339979. The reversal of 3300339961 is 1699330033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2933847225 + 366492736 = 54165^2 + 19144^2 .
It is a cyclic number.
It is not a de Polignac number, because 3300339961 - 25 = 3300339929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3300339961.
It is not a weakly prime, because it can be changed into another prime (3300379961) 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, 1650169980 + 1650169981.
It is an arithmetic number, because the mean of its divisors is an integer number (1650169981).
Almost surely, 23300339961 is an apocalyptic number.
It is an amenable number.
3300339961 is a deficient number, since it is larger than the sum of its proper divisors (1).
3300339961 is an equidigital number, since it uses as much as digits as its factorization.
3300339961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 39366, while the sum is 37.
The square root of 3300339961 is about 57448.5853698766. The cubic root of 3300339961 is about 1488.8566760291.
Adding to 3300339961 its reverse (1699330033), we get a palindrome (4999669994).
The spelling of 3300339961 in words is "three billion, three hundred million, three hundred thirty-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •