Base | Representation |
---|---|
bin | 11110110100111110… |
… | …010111101111001001 |
3 | 10011102212102001020121 |
4 | 132310332113233021 |
5 | 1020242330120410 |
6 | 23112325423241 |
7 | 2251163012536 |
oct | 366476275711 |
9 | 104385361217 |
10 | 33101020105 |
11 | 1304673236a |
12 | 64b956ab21 |
13 | 317698953a |
14 | 1860229d8d |
15 | cdaec49da |
hex | 7b4f97bc9 |
33101020105 has 8 divisors (see below), whose sum is σ = 40794770952. Its totient is φ = 25765118208.
The previous prime is 33101020079. The next prime is 33101020153. The reversal of 33101020105 is 50102010133.
It can be written as a sum of positive squares in 4 ways, for example, as 1832524864 + 31268495241 = 42808^2 + 176829^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 33101020105 - 29 = 33101019593 is a prime.
It is a super-2 number, since 2×331010201052 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
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 7 ways as a sum of consecutive naturals, for example, 89462032 + ... + 89462401.
It is an arithmetic number, because the mean of its divisors is an integer number (5099346369).
Almost surely, 233101020105 is an apocalyptic number.
It is an amenable number.
33101020105 is a deficient number, since it is larger than the sum of its proper divisors (7693750847).
33101020105 is a wasteful number, since it uses less digits than its factorization.
33101020105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178924475.
The product of its (nonzero) digits is 90, while the sum is 16.
Adding to 33101020105 its reverse (50102010133), we get a palindrome (83203030238).
The spelling of 33101020105 in words is "thirty-three billion, one hundred one million, twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •