Base | Representation |
---|---|
bin | 1111001001011101000111… |
… | …10110000010010101000001 |
3 | 11100221102111112001122022111 |
4 | 13210232203312002111001 |
5 | 13331223312334411001 |
6 | 154502300502535321 |
7 | 10005404211201466 |
oct | 744564366022501 |
9 | 140842445048274 |
10 | 33310220232001 |
11 | a68286aa1a659 |
12 | 389b8b1437541 |
13 | 15781a92a73bb |
14 | 83231a8b566d |
15 | 3cb71e08d851 |
hex | 1e4ba3d82541 |
33310220232001 has 2 divisors, whose sum is σ = 33310220232002. Its totient is φ = 33310220232000.
The previous prime is 33310220231963. The next prime is 33310220232017. The reversal of 33310220232001 is 10023202201333.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22883785690000 + 10426434542001 = 4783700^2 + 3228999^2 .
It is a cyclic number.
It is not a de Polignac number, because 33310220232001 - 29 = 33310220231489 is a prime.
It is a super-2 number, since 2×333102202320012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (33310220262001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16655110116000 + 16655110116001.
It is an arithmetic number, because the mean of its divisors is an integer number (16655110116001).
Almost surely, 233310220232001 is an apocalyptic number.
It is an amenable number.
33310220232001 is a deficient number, since it is larger than the sum of its proper divisors (1).
33310220232001 is an equidigital number, since it uses as much as digits as its factorization.
33310220232001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 33310220232001 its reverse (10023202201333), we get a palindrome (43333422433334).
The spelling of 33310220232001 in words is "thirty-three trillion, three hundred ten billion, two hundred twenty million, two hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •