Base | Representation |
---|---|
bin | 1011001011100100… |
… | …0011110001100001 |
3 | 21202011110221111112 |
4 | 2302321003301201 |
5 | 22121313131423 |
6 | 1213452153105 |
7 | 134242434635 |
oct | 26271036141 |
9 | 7664427445 |
10 | 3001302113 |
11 | 130017a777 |
12 | 6b9168795 |
13 | 38aa4c114 |
14 | 206864dc5 |
15 | 12874ea78 |
hex | b2e43c61 |
3001302113 has 2 divisors, whose sum is σ = 3001302114. Its totient is φ = 3001302112.
The previous prime is 3001302103. The next prime is 3001302127. The reversal of 3001302113 is 3112031003.
It is an a-pointer prime, because the next prime (3001302127) can be obtained adding 3001302113 to its sum of digits (14).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2549442064 + 451860049 = 50492^2 + 21257^2 .
It is an emirp because it is prime and its reverse (3112031003) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3001302113 - 24 = 3001302097 is a prime.
It is not a weakly prime, because it can be changed into another prime (3001302103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1500651056 + 1500651057.
It is an arithmetic number, because the mean of its divisors is an integer number (1500651057).
Almost surely, 23001302113 is an apocalyptic number.
It is an amenable number.
3001302113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3001302113 is an equidigital number, since it uses as much as digits as its factorization.
3001302113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 3001302113 is about 54784.1410720292. The cubic root of 3001302113 is about 1442.4582036715.
Adding to 3001302113 its reverse (3112031003), we get a palindrome (6113333116).
The spelling of 3001302113 in words is "three billion, one million, three hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •