Base | Representation |
---|---|
bin | 11101111001100011… |
… | …110011011111000101 |
3 | 10001212101201100022101 |
4 | 131321203303133011 |
5 | 1011222133401013 |
6 | 22425400232101 |
7 | 2214400125055 |
oct | 357143633705 |
9 | 101771640271 |
10 | 32104200133 |
11 | 12684a90805 |
12 | 627b76b631 |
13 | 30482c3935 |
14 | 17a7aa9565 |
15 | c7d7208dd |
hex | 7798f37c5 |
32104200133 has 4 divisors (see below), whose sum is σ = 32129341740. Its totient is φ = 32079058528.
The previous prime is 32104200131. The next prime is 32104200173. The reversal of 32104200133 is 33100240123.
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 26257609764 + 5846590369 = 162042^2 + 76463^2 .
It is a cyclic number.
It is not a de Polignac number, because 32104200133 - 21 = 32104200131 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 32104200133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32104200131) 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, 12568888 + ... + 12571441.
It is an arithmetic number, because the mean of its divisors is an integer number (8032335435).
Almost surely, 232104200133 is an apocalyptic number.
It is an amenable number.
32104200133 is a deficient number, since it is larger than the sum of its proper divisors (25141607).
32104200133 is a wasteful number, since it uses less digits than its factorization.
32104200133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25141606.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 32104200133 its reverse (33100240123), we get a palindrome (65204440256).
The spelling of 32104200133 in words is "thirty-two billion, one hundred four million, two hundred thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •