Base | Representation |
---|---|
bin | 11101111010000101… |
… | …110111101101010001 |
3 | 10001220000112001020002 |
4 | 131322011313231101 |
5 | 1011231430132241 |
6 | 22430315455345 |
7 | 2214536050436 |
oct | 357205675521 |
9 | 101800461202 |
10 | 32113130321 |
11 | 1268a030128 |
12 | 6282757555 |
13 | 304a0cc57c |
14 | 17a8d51b8d |
15 | c7e3d689b |
hex | 77a177b51 |
32113130321 has 8 divisors (see below), whose sum is σ = 33266003400. Its totient is φ = 30977858560.
The previous prime is 32113130293. The next prime is 32113130347. The reversal of 32113130321 is 12303131123.
It can be written as a sum of positive squares in 4 ways, for example, as 3403555600 + 28709574721 = 58340^2 + 169439^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 32113130321 - 226 = 32046021457 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32113130293 and 32113130302.
It is not an unprimeable number, because it can be changed into a prime (32113130821) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4396616 + ... + 4403913.
It is an arithmetic number, because the mean of its divisors is an integer number (4158250425).
Almost surely, 232113130321 is an apocalyptic number.
It is an amenable number.
32113130321 is a deficient number, since it is larger than the sum of its proper divisors (1152873079).
32113130321 is an equidigital number, since it uses as much as digits as its factorization.
32113130321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8800659.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 32113130321 its reverse (12303131123), we get a palindrome (44416261444).
The spelling of 32113130321 in words is "thirty-two billion, one hundred thirteen million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.243 sec. • engine limits •