Base | Representation |
---|---|
bin | 111101100100101… |
… | …100100110000101 |
3 | 2122222211100210011 |
4 | 331210230212011 |
5 | 4103423430041 |
6 | 250301230221 |
7 | 34412416222 |
oct | 7544544605 |
9 | 2588740704 |
10 | 1033030021 |
11 | 490133821 |
12 | 249b62371 |
13 | 13603338a |
14 | 9b2a8949 |
15 | 60a57e81 |
hex | 3d92c985 |
1033030021 has 2 divisors, whose sum is σ = 1033030022. Its totient is φ = 1033030020.
The previous prime is 1033030003. The next prime is 1033030087. The reversal of 1033030021 is 1200303301.
1033030021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1017929025 + 15100996 = 31905^2 + 3886^2 .
It is a cyclic number.
It is not a de Polignac number, because 1033030021 - 25 = 1033029989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1033029983 and 1033030010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1033030091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516515010 + 516515011.
It is an arithmetic number, because the mean of its divisors is an integer number (516515011).
Almost surely, 21033030021 is an apocalyptic number.
It is an amenable number.
1033030021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1033030021 is an equidigital number, since it uses as much as digits as its factorization.
1033030021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 13.
The square root of 1033030021 is about 32140.7843868192. The cubic root of 1033030021 is about 1010.8909633145.
Adding to 1033030021 its reverse (1200303301), we get a palindrome (2233333322).
The spelling of 1033030021 in words is "one billion, thirty-three million, thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •