Base | Representation |
---|---|
bin | 11110000001000111… |
… | …100011101011111001 |
3 | 10002012020100010000102 |
4 | 132001013203223321 |
5 | 1012002114404423 |
6 | 22450130245145 |
7 | 2220500043155 |
oct | 360107435371 |
9 | 102166303012 |
10 | 32231013113 |
11 | 1273a626222 |
12 | 62b61267b5 |
13 | 30686648c0 |
14 | 17ba87a065 |
15 | c8991ec28 |
hex | 7811e3af9 |
32231013113 has 8 divisors (see below), whose sum is σ = 34722294600. Its totient is φ = 29741442048.
The previous prime is 32231013103. The next prime is 32231013149. The reversal of 32231013113 is 31131013223.
It can be written as a sum of positive squares in 4 ways, for example, as 4182467584 + 28048545529 = 64672^2 + 167477^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 32231013113 - 222 = 32226818809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32231013103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 388328 + ... + 463961.
It is an arithmetic number, because the mean of its divisors is an integer number (4340286825).
Almost surely, 232231013113 is an apocalyptic number.
It is an amenable number.
32231013113 is a deficient number, since it is larger than the sum of its proper divisors (2491281487).
32231013113 is a wasteful number, since it uses less digits than its factorization.
32231013113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 855211.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 32231013113 its reverse (31131013223), we get a palindrome (63362026336).
The spelling of 32231013113 in words is "thirty-two billion, two hundred thirty-one million, thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •