Base | Representation |
---|---|
bin | 101100001000101110001… |
… | …000111111100000111101 |
3 | 101201221202110010220111001 |
4 | 230020232020333200331 |
5 | 344143111340121341 |
6 | 10241203422330301 |
7 | 432062042204053 |
oct | 54105610774075 |
9 | 11657673126431 |
10 | 3033021020221 |
11 | a6a32a327a35 |
12 | 40b9a0729991 |
13 | 190021a5911a |
14 | a6b2865a1d3 |
15 | 53d686b4d31 |
hex | 2c22e23f83d |
3033021020221 has 2 divisors, whose sum is σ = 3033021020222. Its totient is φ = 3033021020220.
The previous prime is 3033021020203. The next prime is 3033021020231. The reversal of 3033021020221 is 1220201203303.
3033021020221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2313094224996 + 719926795225 = 1520886^2 + 848485^2 .
It is a cyclic number.
It is not a de Polignac number, because 3033021020221 - 25 = 3033021020189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3033021020231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1516510510110 + 1516510510111.
It is an arithmetic number, because the mean of its divisors is an integer number (1516510510111).
Almost surely, 23033021020221 is an apocalyptic number.
It is an amenable number.
3033021020221 is a deficient number, since it is larger than the sum of its proper divisors (1).
3033021020221 is an equidigital number, since it uses as much as digits as its factorization.
3033021020221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 3033021020221 its reverse (1220201203303), we get a palindrome (4253222223524).
The spelling of 3033021020221 in words is "three trillion, thirty-three billion, twenty-one million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •