Base | Representation |
---|---|
bin | 1011010000000010… |
… | …0000101111111101 |
3 | 21210110201120110212 |
4 | 2310000200233331 |
5 | 22141112024041 |
6 | 1215401442205 |
7 | 134560566665 |
oct | 26400405775 |
9 | 7713646425 |
10 | 3020033021 |
11 | 130a803565 |
12 | 7034a0365 |
13 | 3918a99b5 |
14 | 20913d1a5 |
15 | 12a1ee8eb |
hex | b4020bfd |
3020033021 has 2 divisors, whose sum is σ = 3020033022. Its totient is φ = 3020033020.
The previous prime is 3020032999. The next prime is 3020033039. The reversal of 3020033021 is 1203300203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1878268921 + 1141764100 = 43339^2 + 33790^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3020033021 is a prime.
It is a super-3 number, since 3×30200330213 (a number of 29 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3020032987 and 3020033005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3020033041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1510016510 + 1510016511.
It is an arithmetic number, because the mean of its divisors is an integer number (1510016511).
Almost surely, 23020033021 is an apocalyptic number.
It is an amenable number.
3020033021 is a deficient number, since it is larger than the sum of its proper divisors (1).
3020033021 is an equidigital number, since it uses as much as digits as its factorization.
3020033021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 14.
The square root of 3020033021 is about 54954.8270946238. The cubic root of 3020033021 is about 1445.4527416004.
Adding to 3020033021 its reverse (1203300203), we get a palindrome (4223333224).
The spelling of 3020033021 in words is "three billion, twenty million, thirty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •