Base | Representation |
---|---|
bin | 1111001001101111100110… |
… | …10011010010010110110001 |
3 | 11100222101010001221101200212 |
4 | 13210313303103102112301 |
5 | 13331404123132000411 |
6 | 154511021255153505 |
7 | 10006205132264045 |
oct | 744676323222661 |
9 | 140871101841625 |
10 | 33320143234481 |
11 | a686aa2224254 |
12 | 38a1800675895 |
13 | 15790cb045cbc |
14 | 8329bc714025 |
15 | 3cbb002dc68b |
hex | 1e4df34d25b1 |
33320143234481 has 2 divisors, whose sum is σ = 33320143234482. Its totient is φ = 33320143234480.
The previous prime is 33320143234387. The next prime is 33320143234489. The reversal of 33320143234481 is 18443234102333.
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., 33318119674225 + 2023560256 = 5772185^2 + 44984^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33320143234481 is a prime.
It is a super-2 number, since 2×333201432344812 (a number of 28 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (33320143234489) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16660071617240 + 16660071617241.
It is an arithmetic number, because the mean of its divisors is an integer number (16660071617241).
Almost surely, 233320143234481 is an apocalyptic number.
It is an amenable number.
33320143234481 is a deficient number, since it is larger than the sum of its proper divisors (1).
33320143234481 is an equidigital number, since it uses as much as digits as its factorization.
33320143234481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 497664, while the sum is 41.
The spelling of 33320143234481 in words is "thirty-three trillion, three hundred twenty billion, one hundred forty-three million, two hundred thirty-four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •