Base | Representation |
---|---|
bin | 11101111111010001… |
… | …010011010100101101 |
3 | 10002010002000010222211 |
4 | 131333101103110231 |
5 | 1011421200404401 |
6 | 22443102010421 |
7 | 2216642411134 |
oct | 357721232455 |
9 | 102102003884 |
10 | 32200013101 |
11 | 12724082483 |
12 | 62a7876a11 |
13 | 30620cc6b9 |
14 | 17b66ca91b |
15 | c86d49951 |
hex | 77f45352d |
32200013101 has 4 divisors (see below), whose sum is σ = 32807560572. Its totient is φ = 31592465632.
The previous prime is 32200013057. The next prime is 32200013113. The reversal of 32200013101 is 10131000223.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10131000223 = 55147 ⋅183709.
It can be written as a sum of positive squares in 2 ways, for example, as 20884585225 + 11315427876 = 144515^2 + 106374^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32200013101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32200013171) 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, 303773656 + ... + 303773761.
It is an arithmetic number, because the mean of its divisors is an integer number (8201890143).
Almost surely, 232200013101 is an apocalyptic number.
It is an amenable number.
32200013101 is a deficient number, since it is larger than the sum of its proper divisors (607547471).
32200013101 is an equidigital number, since it uses as much as digits as its factorization.
32200013101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607547470.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 32200013101 its reverse (10131000223), we get a palindrome (42331013324).
The spelling of 32200013101 in words is "thirty-two billion, two hundred million, thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •