Base | Representation |
---|---|
bin | 1011010010100010… |
… | …0011011111100101 |
3 | 21211012110212122122 |
4 | 2310220203133211 |
5 | 22201303430041 |
6 | 1220414435325 |
7 | 135046036331 |
oct | 26450433745 |
9 | 7735425578 |
10 | 3030530021 |
11 | 1315723072 |
12 | 706b02b45 |
13 | 393b1383c |
14 | 20a6b27c1 |
15 | 12b0c4c4b |
hex | b4a237e5 |
3030530021 has 2 divisors, whose sum is σ = 3030530022. Its totient is φ = 3030530020.
The previous prime is 3030530017. The next prime is 3030530051. The reversal of 3030530021 is 1200350303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2341204996 + 689325025 = 48386^2 + 26255^2 .
It is a cyclic number.
It is not a de Polignac number, because 3030530021 - 22 = 3030530017 is a prime.
It is a super-2 number, since 2×30305300212 = 18368224416364520882, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3030530051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1515265010 + 1515265011.
It is an arithmetic number, because the mean of its divisors is an integer number (1515265011).
Almost surely, 23030530021 is an apocalyptic number.
It is an amenable number.
3030530021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3030530021 is an equidigital number, since it uses as much as digits as its factorization.
3030530021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 17.
The square root of 3030530021 is about 55050.2499631019. The cubic root of 3030530021 is about 1447.1255016773.
Adding to 3030530021 its reverse (1200350303), we get a palindrome (4230880324).
The spelling of 3030530021 in words is "three billion, thirty million, five hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •