Base | Representation |
---|---|
bin | 1000110010100001001… |
… | …11110101010111100101 |
3 | 1001212111220220022221022 |
4 | 10121100213311113211 |
5 | 14421444041031323 |
6 | 350423111100525 |
7 | 30550564311011 |
oct | 4312047652745 |
9 | 1055456808838 |
10 | 302000330213 |
11 | 107094349a6a |
12 | 4a643371745 |
13 | 2262b39035a |
14 | 1088ca85541 |
15 | 7cc80d94c8 |
hex | 46509f55e5 |
302000330213 has 2 divisors, whose sum is σ = 302000330214. Its totient is φ = 302000330212.
The previous prime is 302000330189. The next prime is 302000330263. The reversal of 302000330213 is 312033000203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 232600750369 + 69399579844 = 482287^2 + 263438^2 .
It is a cyclic number.
It is not a de Polignac number, because 302000330213 - 220 = 301999281637 is a prime.
It is a super-2 number, since 2×3020003302132 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 302000330191 and 302000330200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (302000330263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151000165106 + 151000165107.
It is an arithmetic number, because the mean of its divisors is an integer number (151000165107).
Almost surely, 2302000330213 is an apocalyptic number.
It is an amenable number.
302000330213 is a deficient number, since it is larger than the sum of its proper divisors (1).
302000330213 is an equidigital number, since it uses as much as digits as its factorization.
302000330213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 17.
Adding to 302000330213 its reverse (312033000203), we get a palindrome (614033330416).
The spelling of 302000330213 in words is "three hundred two billion, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •