Base | Representation |
---|---|
bin | 111001110100… |
… | …0101101100001 |
3 | 2010001002001022 |
4 | 1303220231201 |
5 | 30230011223 |
6 | 3001415225 |
7 | 515442002 |
oct | 163505541 |
9 | 63032038 |
10 | 30313313 |
11 | 16124928 |
12 | a19a515 |
13 | 6384794 |
14 | 40511a9 |
15 | 29dbac8 |
hex | 1ce8b61 |
30313313 has 2 divisors, whose sum is σ = 30313314. Its totient is φ = 30313312.
The previous prime is 30313307. The next prime is 30313321. The reversal of 30313313 is 31331303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18258529 + 12054784 = 4273^2 + 3472^2 .
It is an emirp because it is prime and its reverse (31331303) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30313313 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 30313291 and 30313300.
It is not a weakly prime, because it can be changed into another prime (30313013) 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, 15156656 + 15156657.
It is an arithmetic number, because the mean of its divisors is an integer number (15156657).
Almost surely, 230313313 is an apocalyptic number.
It is an amenable number.
30313313 is a deficient number, since it is larger than the sum of its proper divisors (1).
30313313 is an equidigital number, since it uses as much as digits as its factorization.
30313313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 17.
The square root of 30313313 is about 5505.7527187479. The cubic root of 30313313 is about 311.8012136371.
Adding to 30313313 its reverse (31331303), we get a palindrome (61644616).
The spelling of 30313313 in words is "thirty million, three hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •