Base | Representation |
---|---|
bin | 111100010001100… |
… | …000001000101001 |
3 | 2121110210100110212 |
4 | 330101200020221 |
5 | 4032333033113 |
6 | 244201550505 |
7 | 34026144164 |
oct | 7421401051 |
9 | 2543710425 |
10 | 1011221033 |
11 | 479898369 |
12 | 2427a5435 |
13 | 131668754 |
14 | 9842cadb |
15 | 5db9b0a8 |
hex | 3c460229 |
1011221033 has 2 divisors, whose sum is σ = 1011221034. Its totient is φ = 1011221032.
The previous prime is 1011221011. The next prime is 1011221051. The reversal of 1011221033 is 3301221101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 862185769 + 149035264 = 29363^2 + 12208^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011221033 - 212 = 1011216937 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1011220999 and 1011221017.
It is not a weakly prime, because it can be changed into another prime (1011221083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505610516 + 505610517.
It is an arithmetic number, because the mean of its divisors is an integer number (505610517).
Almost surely, 21011221033 is an apocalyptic number.
It is an amenable number.
1011221033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011221033 is an equidigital number, since it uses as much as digits as its factorization.
1011221033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1011221033 is about 31799.7017753312. The cubic root of 1011221033 is about 1003.7264407240.
Adding to 1011221033 its reverse (3301221101), we get a palindrome (4312442134).
The spelling of 1011221033 in words is "one billion, eleven million, two hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •