Base | Representation |
---|---|
bin | 11110110110101101… |
… | …001000110100000001 |
3 | 10011111220001021022201 |
4 | 132312231020310001 |
5 | 1020322243310321 |
6 | 23115244033201 |
7 | 2251664560231 |
oct | 366655106401 |
9 | 104456037281 |
10 | 33130056961 |
11 | 13061065171 |
12 | 6507232801 |
13 | 317c9b5001 |
14 | 1864027cc1 |
15 | cdd80d291 |
hex | 7b6b48d01 |
33130056961 has 2 divisors, whose sum is σ = 33130056962. Its totient is φ = 33130056960.
The previous prime is 33130056917. The next prime is 33130056983. The reversal of 33130056961 is 16965003133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18785443600 + 14344613361 = 137060^2 + 119769^2 .
It is a cyclic number.
It is not a de Polignac number, because 33130056961 - 229 = 32593186049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 33130056961.
It is not a weakly prime, because it can be changed into another prime (33130056901) 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, 16565028480 + 16565028481.
It is an arithmetic number, because the mean of its divisors is an integer number (16565028481).
Almost surely, 233130056961 is an apocalyptic number.
It is an amenable number.
33130056961 is a deficient number, since it is larger than the sum of its proper divisors (1).
33130056961 is an equidigital number, since it uses as much as digits as its factorization.
33130056961 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 37.
The spelling of 33130056961 in words is "thirty-three billion, one hundred thirty million, fifty-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •