Base | Representation |
---|---|
bin | 1111000001000010100111… |
… | …01101111011110101001000 |
3 | 11022220210021011000202200011 |
4 | 13200201103231323311020 |
5 | 13312004214424401440 |
6 | 154121405010121304 |
7 | 6645460652255224 |
oct | 740412355736510 |
9 | 138823234022604 |
10 | 33021113122120 |
11 | a5811a2553992 |
12 | 3853867b80234 |
13 | 1556b54140406 |
14 | 822332321784 |
15 | 3c3e4cd629ea |
hex | 1e0853b7bd48 |
33021113122120 has 16 divisors (see below), whose sum is σ = 74297504524860. Its totient is φ = 13208445248832.
The previous prime is 33021113122079. The next prime is 33021113122141. The reversal of 33021113122120 is 2122131112033.
It can be written as a sum of positive squares in 2 ways, for example, as 29557859117796 + 3463254004324 = 5436714^2 + 1860982^2 .
It is a junction number, because it is equal to n+sod(n) for n = 33021113122091 and 33021113122100.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 412763913987 + ... + 412763914066.
Almost surely, 233021113122120 is an apocalyptic number.
It is an amenable number.
33021113122120 is an abundant number, since it is smaller than the sum of its proper divisors (41276391402740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33021113122120 is a wasteful number, since it uses less digits than its factorization.
33021113122120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 825527828064 (or 825527828060 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 33021113122120 its reverse (2122131112033), we get a palindrome (35143244234153).
The spelling of 33021113122120 in words is "thirty-three trillion, twenty-one billion, one hundred thirteen million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •