Base | Representation |
---|---|
bin | 11110000100001010110… |
… | …00101101111010111001 |
3 | 10122202102122012021212222 |
4 | 33002011120231322321 |
5 | 113411121140002223 |
6 | 2110322322013425 |
7 | 134430306060023 |
oct | 17020530557271 |
9 | 3582378167788 |
10 | 1033030000313 |
11 | 369118560013 |
12 | 14825b7a7275 |
13 | 7655031a31c |
14 | 37ddb067013 |
15 | 1bd113ad0c8 |
hex | f08562deb9 |
1033030000313 has 2 divisors, whose sum is σ = 1033030000314. Its totient is φ = 1033030000312.
The previous prime is 1033030000309. The next prime is 1033030000333. The reversal of 1033030000313 is 3130000303301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 927153300544 + 105876699769 = 962888^2 + 325387^2 .
It is an emirp because it is prime and its reverse (3130000303301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1033030000313 - 22 = 1033030000309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1033030000291 and 1033030000300.
It is not a weakly prime, because it can be changed into another prime (1033030000333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516515000156 + 516515000157.
It is an arithmetic number, because the mean of its divisors is an integer number (516515000157).
Almost surely, 21033030000313 is an apocalyptic number.
It is an amenable number.
1033030000313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033030000313 is an equidigital number, since it uses as much as digits as its factorization.
1033030000313 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.
Adding to 1033030000313 its reverse (3130000303301), we get a palindrome (4163030303614).
The spelling of 1033030000313 in words is "one trillion, thirty-three billion, thirty million, three hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •