Base | Representation |
---|---|
bin | 1011001100000010… |
… | …1110011111110001 |
3 | 21202022021001200222 |
4 | 2303000232133301 |
5 | 22122321441423 |
6 | 1214003222425 |
7 | 134265505664 |
oct | 26300563761 |
9 | 7668231628 |
10 | 3003312113 |
11 | 130132292a |
12 | 6b9977a15 |
13 | 38b2a3c79 |
14 | 206c296db |
15 | 1289ea3c8 |
hex | b302e7f1 |
3003312113 has 2 divisors, whose sum is σ = 3003312114. Its totient is φ = 3003312112.
The previous prime is 3003312097. The next prime is 3003312149. The reversal of 3003312113 is 3112133003.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1829016289 + 1174295824 = 42767^2 + 34268^2 .
It is a cyclic number.
It is not a de Polignac number, because 3003312113 - 24 = 3003312097 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3003312091 and 3003312100.
It is not a weakly prime, because it can be changed into another prime (3003312913) 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, 1501656056 + 1501656057.
It is an arithmetic number, because the mean of its divisors is an integer number (1501656057).
Almost surely, 23003312113 is an apocalyptic number.
It is an amenable number.
3003312113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3003312113 is an equidigital number, since it uses as much as digits as its factorization.
3003312113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 3003312113 is about 54802.4827266065. The cubic root of 3003312113 is about 1442.7801410487.
Adding to 3003312113 its reverse (3112133003), we get a palindrome (6115445116).
The spelling of 3003312113 in words is "three billion, three million, three hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •