Base | Representation |
---|---|
bin | 11110110100111110… |
… | …101100000000010001 |
3 | 10011102212120021010021 |
4 | 132310332230000101 |
5 | 1020242340244441 |
6 | 23112331303441 |
7 | 2251163506552 |
oct | 366476540021 |
9 | 104385507107 |
10 | 33101103121 |
11 | 13046789779 |
12 | 64b95aab81 |
13 | 31769b8268 |
14 | 186024c329 |
15 | cdaede3d1 |
hex | 7b4fac011 |
33101103121 has 12 divisors (see below), whose sum is σ = 36375281820. Its totient is φ = 30079696640.
The previous prime is 33101103073. The next prime is 33101103193. The reversal of 33101103121 is 12130110133.
It can be written as a sum of positive squares in 6 ways, for example, as 4030853121 + 29070250000 = 63489^2 + 170500^2 .
It is not a de Polignac number, because 33101103121 - 29 = 33101102609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 33101103095 and 33101103104.
It is not an unprimeable number, because it can be changed into a prime (33101103421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1966390 + ... + 1983151.
It is an arithmetic number, because the mean of its divisors is an integer number (3031273485).
Almost surely, 233101103121 is an apocalyptic number.
It is an amenable number.
33101103121 is a deficient number, since it is larger than the sum of its proper divisors (3274178699).
33101103121 is a wasteful number, since it uses less digits than its factorization.
33101103121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3949604 (or 3949587 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 33101103121 its reverse (12130110133), we get a palindrome (45231213254).
The spelling of 33101103121 in words is "thirty-three billion, one hundred one million, one hundred three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •