Base | Representation |
---|---|
bin | 11101110011011011… |
… | …010110010011000100 |
3 | 10001121020010111110222 |
4 | 131303123112103010 |
5 | 1011014314221012 |
6 | 22411243203512 |
7 | 2212010506265 |
oct | 356333262304 |
9 | 101536114428 |
10 | 32001320132 |
11 | 12631a02511 |
12 | 6251216598 |
13 | 302cbb22b2 |
14 | 179816896c |
15 | c7469c972 |
hex | 7736d64c4 |
32001320132 has 12 divisors (see below), whose sum is σ = 59296563900. Its totient is φ = 15059444736.
The previous prime is 32001320111. The next prime is 32001320261. The reversal of 32001320132 is 23102310023.
It can be written as a sum of positive squares in 2 ways, for example, as 17385477316 + 14615842816 = 131854^2 + 120896^2 .
It is a Harshad number since it is a multiple of its sum of digits (17).
32001320132 is a modest number, since divided by 1320132 gives 320 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 32001320132.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 235303757 + ... + 235303892.
It is an arithmetic number, because the mean of its divisors is an integer number (4941380325).
Almost surely, 232001320132 is an apocalyptic number.
It is an amenable number.
32001320132 is a deficient number, since it is larger than the sum of its proper divisors (27295243768).
32001320132 is a wasteful number, since it uses less digits than its factorization.
32001320132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470607670 (or 470607668 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 32001320132 its reverse (23102310023), we get a palindrome (55103630155).
The spelling of 32001320132 in words is "thirty-two billion, one million, three hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •