Base | Representation |
---|---|
bin | 10010000011111… |
… | …011011111110101 |
3 | 210010012000022202 |
4 | 102003323133311 |
5 | 1110033120041 |
6 | 50022434245 |
7 | 10336425203 |
oct | 2203733765 |
9 | 703160282 |
10 | 303020021 |
11 | 146057477 |
12 | 85592985 |
13 | 4aa175b5 |
14 | 2c35c073 |
15 | 1b908a9b |
hex | 120fb7f5 |
303020021 has 2 divisors, whose sum is σ = 303020022. Its totient is φ = 303020020.
The previous prime is 303020017. The next prime is 303020023. The reversal of 303020021 is 120020303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 299463025 + 3556996 = 17305^2 + 1886^2 .
It is a cyclic number.
It is not a de Polignac number, because 303020021 - 22 = 303020017 is a prime.
It is a super-2 number, since 2×3030200212 = 183642266253680882, which contains 22 as substring.
Together with 303020023, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 303019984 and 303020011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (303020023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151510010 + 151510011.
It is an arithmetic number, because the mean of its divisors is an integer number (151510011).
Almost surely, 2303020021 is an apocalyptic number.
It is an amenable number.
303020021 is a deficient number, since it is larger than the sum of its proper divisors (1).
303020021 is an equidigital number, since it uses as much as digits as its factorization.
303020021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 11.
The square root of 303020021 is about 17407.4702642285. The cubic root of 303020021 is about 671.6717892775.
Adding to 303020021 its reverse (120020303), we get a palindrome (423040324).
The spelling of 303020021 in words is "three hundred three million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •