Base | Representation |
---|---|
bin | 111100110111101… |
… | …001100100001101 |
3 | 2122011121102000221 |
4 | 330313221210031 |
5 | 4042413034013 |
6 | 245200151341 |
7 | 34210144042 |
oct | 7467514415 |
9 | 2564542027 |
10 | 1021221133 |
11 | 4844a8609 |
12 | 246008551 |
13 | 13375a37a |
14 | 998b31c9 |
15 | 5e9c408d |
hex | 3cde990d |
1021221133 has 2 divisors, whose sum is σ = 1021221134. Its totient is φ = 1021221132.
The previous prime is 1021221077. The next prime is 1021221151. The reversal of 1021221133 is 3311221201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 982320964 + 38900169 = 31342^2 + 6237^2 .
It is an emirp because it is prime and its reverse (3311221201) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1021221133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1021221193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 510610566 + 510610567.
It is an arithmetic number, because the mean of its divisors is an integer number (510610567).
Almost surely, 21021221133 is an apocalyptic number.
It is an amenable number.
1021221133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1021221133 is an equidigital number, since it uses as much as digits as its factorization.
1021221133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1021221133 is about 31956.5507056065. The cubic root of 1021221133 is about 1007.0242553114.
Adding to 1021221133 its reverse (3311221201), we get a palindrome (4332442334).
The spelling of 1021221133 in words is "one billion, twenty-one million, two hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •