Base | Representation |
---|---|
bin | 1111000100001110000011… |
… | …01011101010100011000001 |
3 | 11100022020011210222221200022 |
4 | 13202013001223222203001 |
5 | 13320301410021000301 |
6 | 154243510422103225 |
7 | 6656405342163152 |
oct | 742070153524301 |
9 | 140266153887608 |
10 | 33130332203201 |
11 | a613549906062 |
12 | 3870a6927ab15 |
13 | 156423b9084cc |
14 | 827733905929 |
15 | 3c6be1601d1b |
hex | 1e21c1aea8c1 |
33130332203201 has 2 divisors, whose sum is σ = 33130332203202. Its totient is φ = 33130332203200.
The previous prime is 33130332203197. The next prime is 33130332203203. The reversal of 33130332203201 is 10230223303133.
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., 31629645952576 + 1500686250625 = 5624024^2 + 1225025^2 .
It is a cyclic number.
It is not a de Polignac number, because 33130332203201 - 22 = 33130332203197 is a prime.
Together with 33130332203203, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (33130332203203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16565166101600 + 16565166101601.
It is an arithmetic number, because the mean of its divisors is an integer number (16565166101601).
Almost surely, 233130332203201 is an apocalyptic number.
It is an amenable number.
33130332203201 is a deficient number, since it is larger than the sum of its proper divisors (1).
33130332203201 is an equidigital number, since it uses as much as digits as its factorization.
33130332203201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832, while the sum is 26.
Adding to 33130332203201 its reverse (10230223303133), we get a palindrome (43360555506334).
The spelling of 33130332203201 in words is "thirty-three trillion, one hundred thirty billion, three hundred thirty-two million, two hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •