Base | Representation |
---|---|
bin | 11101111010100111… |
… | …101111110111111101 |
3 | 10001220122020020102001 |
4 | 131322213233313331 |
5 | 1011241213324013 |
6 | 22431234102301 |
7 | 2215004406142 |
oct | 357247576775 |
9 | 101818206361 |
10 | 32122011133 |
11 | 12694046443 |
12 | 628571a991 |
13 | 304bbbb8a4 |
14 | 17aa1c43c9 |
15 | c8008cddd |
hex | 77a9efdfd |
32122011133 has 4 divisors (see below), whose sum is σ = 32124099420. Its totient is φ = 32119922848.
The previous prime is 32122011107. The next prime is 32122011143. The reversal of 32122011133 is 33111022123.
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 30794283289 + 1327727844 = 175483^2 + 36438^2 .
It is a cyclic number.
It is not a de Polignac number, because 32122011133 - 25 = 32122011101 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 32122011133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32122011143) 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, 1020898 + ... + 1051891.
It is an arithmetic number, because the mean of its divisors is an integer number (8031024855).
Almost surely, 232122011133 is an apocalyptic number.
It is an amenable number.
32122011133 is a deficient number, since it is larger than the sum of its proper divisors (2088287).
32122011133 is a wasteful number, since it uses less digits than its factorization.
32122011133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2088286.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 32122011133 its reverse (33111022123), we get a palindrome (65233033256).
The spelling of 32122011133 in words is "thirty-two billion, one hundred twenty-two million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •