Base | Representation |
---|---|
bin | 10011001100001000… |
… | …10010000110000001 |
3 | 222120222122202110111 |
4 | 21212010102012001 |
5 | 132044344131223 |
6 | 4422142431321 |
7 | 513205250116 |
oct | 114604220601 |
9 | 28528582414 |
10 | 10302333313 |
11 | 4407442558 |
12 | 1bb6292541 |
13 | c8252431c |
14 | 6da38290d |
15 | 4046cd30d |
hex | 266112181 |
10302333313 has 2 divisors, whose sum is σ = 10302333314. Its totient is φ = 10302333312.
The previous prime is 10302333299. The next prime is 10302333361. The reversal of 10302333313 is 31333320301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9371595249 + 930738064 = 96807^2 + 30508^2 .
It is an emirp because it is prime and its reverse (31333320301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10302333313 is a prime.
It is a super-2 number, since 2×103023333132 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10302334313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5151166656 + 5151166657.
It is an arithmetic number, because the mean of its divisors is an integer number (5151166657).
Almost surely, 210302333313 is an apocalyptic number.
It is an amenable number.
10302333313 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302333313 is an equidigital number, since it uses as much as digits as its factorization.
10302333313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 10302333313 its reverse (31333320301), we get a palindrome (41635653614).
The spelling of 10302333313 in words is "ten billion, three hundred two million, three hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •