Base | Representation |
---|---|
bin | 1111000001100110011011… |
… | …01111011111110011100001 |
3 | 11022222121220010012121010011 |
4 | 13200303031233133303201 |
5 | 13312313104044034103 |
6 | 154134304525404521 |
7 | 6650041301022436 |
oct | 740631557376341 |
9 | 138877803177104 |
10 | 33040340221153 |
11 | a589369770a81 |
12 | 3857533109741 |
13 | 15588c96628a5 |
14 | 823237ad3b8d |
15 | 3c46c5d0ad6d |
hex | 1e0ccdbdfce1 |
33040340221153 has 4 divisors (see below), whose sum is σ = 33040357659568. Its totient is φ = 33040322782740.
The previous prime is 33040340221129. The next prime is 33040340221157. The reversal of 33040340221153 is 35112204304033.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-33040340221153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (33040340221157) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5474751 + ... + 9800692.
It is an arithmetic number, because the mean of its divisors is an integer number (8260089414892).
Almost surely, 233040340221153 is an apocalyptic number.
It is an amenable number.
33040340221153 is a deficient number, since it is larger than the sum of its proper divisors (17438415).
33040340221153 is a wasteful number, since it uses less digits than its factorization.
33040340221153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17438414.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 33040340221153 its reverse (35112204304033), we get a palindrome (68152544525186).
The spelling of 33040340221153 in words is "thirty-three trillion, forty billion, three hundred forty million, two hundred twenty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •