Base | Representation |
---|---|
bin | 1111000100001101111111… |
… | …11000011101011110110001 |
3 | 11100022020002201011121221211 |
4 | 13202012333320131132301 |
5 | 13320301324303044441 |
6 | 154243503422520121 |
7 | 6656404524402241 |
oct | 742067770353661 |
9 | 140266081147854 |
10 | 33130302003121 |
11 | a613533859314 |
12 | 3870a5b136041 |
13 | 156423559343b |
14 | 82772d8c3b21 |
15 | 3c6bddb38a81 |
hex | 1e21bfe1d7b1 |
33130302003121 has 2 divisors, whose sum is σ = 33130302003122. Its totient is φ = 33130302003120.
The previous prime is 33130302003079. The next prime is 33130302003133. The reversal of 33130302003121 is 12130020303133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27599903180721 + 5530398822400 = 5253561^2 + 2351680^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33130302003121 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 33130302003092 and 33130302003101.
It is not a weakly prime, because it can be changed into another prime (33130302003191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16565151001560 + 16565151001561.
It is an arithmetic number, because the mean of its divisors is an integer number (16565151001561).
Almost surely, 233130302003121 is an apocalyptic number.
It is an amenable number.
33130302003121 is a deficient number, since it is larger than the sum of its proper divisors (1).
33130302003121 is an equidigital number, since it uses as much as digits as its factorization.
33130302003121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 33130302003121 its reverse (12130020303133), we get a palindrome (45260322306254).
The spelling of 33130302003121 in words is "thirty-three trillion, one hundred thirty billion, three hundred two million, three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •