Base | Representation |
---|---|
bin | 11110101111001100… |
… | …101110111111110101 |
3 | 10011012010002010011122 |
4 | 132233030232333311 |
5 | 1020043023401401 |
6 | 23054544513325 |
7 | 2245605260216 |
oct | 365714567765 |
9 | 104163063148 |
10 | 33004122101 |
11 | 12aa6a6a475 |
12 | 649101b845 |
13 | 315c890942 |
14 | 185140540d |
15 | cd273421b |
hex | 7af32eff5 |
33004122101 has 4 divisors (see below), whose sum is σ = 33296194092. Its totient is φ = 32712050112.
The previous prime is 33004122097. The next prime is 33004122119. The reversal of 33004122101 is 10122140033.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13228450225 + 19775671876 = 115015^2 + 140626^2 .
It is a cyclic number.
It is not a de Polignac number, because 33004122101 - 22 = 33004122097 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 33004122101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33004122001) 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, 146035826 + ... + 146036051.
It is an arithmetic number, because the mean of its divisors is an integer number (8324048523).
Almost surely, 233004122101 is an apocalyptic number.
It is an amenable number.
33004122101 is a deficient number, since it is larger than the sum of its proper divisors (292071991).
33004122101 is a wasteful number, since it uses less digits than its factorization.
33004122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292071990.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 33004122101 its reverse (10122140033), we get a palindrome (43126262134).
The spelling of 33004122101 in words is "thirty-three billion, four million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •