Base | Representation |
---|---|
bin | 11101110011011110… |
… | …010111111011000101 |
3 | 10001121021121210101122 |
4 | 131303132113323011 |
5 | 1011020020110341 |
6 | 22411312203325 |
7 | 2212020321431 |
oct | 356336277305 |
9 | 101537553348 |
10 | 32002113221 |
11 | 126323a4361 |
12 | 6251539545 |
13 | 30300cc290 |
14 | 17982d39c1 |
15 | c747a794b |
hex | 773797ec5 |
32002113221 has 64 divisors (see below), whose sum is σ = 37553725440. Its totient is φ = 27043061760.
The previous prime is 32002113217. The next prime is 32002113259. The reversal of 32002113221 is 12231120023.
It is not a de Polignac number, because 32002113221 - 22 = 32002113217 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 32002113221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32002112221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 167550236 + ... + 167550426.
It is an arithmetic number, because the mean of its divisors is an integer number (586776960).
Almost surely, 232002113221 is an apocalyptic number.
It is an amenable number.
32002113221 is a deficient number, since it is larger than the sum of its proper divisors (5551612219).
32002113221 is a wasteful number, since it uses less digits than its factorization.
32002113221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 32002113221 its reverse (12231120023), we get a palindrome (44233233244).
The spelling of 32002113221 in words is "thirty-two billion, two million, one hundred thirteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •