Base | Representation |
---|---|
bin | 1111000000011011100010… |
… | …01101100011010111101001 |
3 | 11022211210010000102220002020 |
4 | 13200031301031203113221 |
5 | 13311133233034111241 |
6 | 154104015111455053 |
7 | 6644116030161633 |
oct | 740156115432751 |
9 | 138753100386066 |
10 | 33000133113321 |
11 | a573306915840 |
12 | 384b791987489 |
13 | 1554b8c707a1a |
14 | 821301c13a53 |
15 | 3c3621063b66 |
hex | 1e03713635e9 |
33000133113321 has 64 divisors (see below), whose sum is σ = 49015689532416. Its totient is φ = 19582031264000.
The previous prime is 33000133113319. The next prime is 33000133113361. The reversal of 33000133113321 is 12331133100033.
It is a cyclic number.
It is not a de Polignac number, because 33000133113321 - 21 = 33000133113319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 33000133113291 and 33000133113300.
It is not an unprimeable number, because it can be changed into a prime (33000133113361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 200701075 + ... + 200865431.
It is an arithmetic number, because the mean of its divisors is an integer number (765870148944).
Almost surely, 233000133113321 is an apocalyptic number.
It is an amenable number.
33000133113321 is a deficient number, since it is larger than the sum of its proper divisors (16015556419095).
33000133113321 is a wasteful number, since it uses less digits than its factorization.
33000133113321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 165142.
The product of its (nonzero) digits is 1458, while the sum is 24.
Adding to 33000133113321 its reverse (12331133100033), we get a palindrome (45331266213354).
The spelling of 33000133113321 in words is "thirty-three trillion, one hundred thirty-three million, one hundred thirteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •