Base | Representation |
---|---|
bin | 111101111100011111… |
… | …0100011000111100101 |
3 | 110201100211012100220012 |
4 | 1323320332203013211 |
5 | 4134414144241341 |
6 | 141040020220005 |
7 | 12416340514325 |
oct | 1737076430745 |
9 | 421324170805 |
10 | 133026165221 |
11 | 51463890924 |
12 | 2194623a605 |
13 | c70cb1a741 |
14 | 661d363285 |
15 | 36d88750eb |
hex | 1ef8fa31e5 |
133026165221 has 2 divisors, whose sum is σ = 133026165222. Its totient is φ = 133026165220.
The previous prime is 133026165143. The next prime is 133026165229. The reversal of 133026165221 is 122561620331.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117820562500 + 15205602721 = 343250^2 + 123311^2 .
It is a cyclic number.
It is not a de Polignac number, because 133026165221 - 214 = 133026148837 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133026165229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66513082610 + 66513082611.
It is an arithmetic number, because the mean of its divisors is an integer number (66513082611).
Almost surely, 2133026165221 is an apocalyptic number.
It is an amenable number.
133026165221 is a deficient number, since it is larger than the sum of its proper divisors (1).
133026165221 is an equidigital number, since it uses as much as digits as its factorization.
133026165221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 133026165221 its reverse (122561620331), we get a palindrome (255587785552).
The spelling of 133026165221 in words is "one hundred thirty-three billion, twenty-six million, one hundred sixty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •