Base | Representation |
---|---|
bin | 111100100110001… |
… | …1011001011111101 |
3 | 12020201000100112121 |
4 | 1321030123023331 |
5 | 13131011101341 |
6 | 533432402541 |
7 | 101246523661 |
oct | 17114331375 |
9 | 5221010477 |
10 | 2033300221 |
11 | 953821607 |
12 | 488b46451 |
13 | 265336534 |
14 | 1540868a1 |
15 | bd78e4d1 |
hex | 7931b2fd |
2033300221 has 2 divisors, whose sum is σ = 2033300222. Its totient is φ = 2033300220.
The previous prime is 2033300197. The next prime is 2033300267. The reversal of 2033300221 is 1220033302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2020952025 + 12348196 = 44955^2 + 3514^2 .
It is a cyclic number.
It is not a de Polignac number, because 2033300221 - 213 = 2033292029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2033300195 and 2033300204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2033300281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1016650110 + 1016650111.
It is an arithmetic number, because the mean of its divisors is an integer number (1016650111).
Almost surely, 22033300221 is an apocalyptic number.
It is an amenable number.
2033300221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2033300221 is an equidigital number, since it uses as much as digits as its factorization.
2033300221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 16.
The square root of 2033300221 is about 45092.1303666172. The cubic root of 2033300221 is about 1266.8752039467.
Adding to 2033300221 its reverse (1220033302), we get a palindrome (3253333523).
The spelling of 2033300221 in words is "two billion, thirty-three million, three hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •