Base | Representation |
---|---|
bin | 11101110100001000… |
… | …010111011001101011 |
3 | 10001122001100001102000 |
4 | 131310020113121223 |
5 | 1011030324334011 |
6 | 22412344142043 |
7 | 2212213016445 |
oct | 356410273153 |
9 | 101561301360 |
10 | 32013121131 |
11 | 12638632802 |
12 | 6255167923 |
13 | 3032484834 |
14 | 179995b495 |
15 | c7572e356 |
hex | 77421766b |
32013121131 has 32 divisors (see below), whose sum is σ = 48077568000. Its totient is φ = 21051023904.
The previous prime is 32013121117. The next prime is 32013121163. The reversal of 32013121131 is 13112131023.
32013121131 is a `hidden beast` number, since 320 + 1 + 312 + 1 + 1 + 31 = 666.
It is not a de Polignac number, because 32013121131 - 223 = 32004732523 is a prime.
It is a super-3 number, since 3×320131211313 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (32013121111) 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 31 ways as a sum of consecutive naturals, for example, 631900 + ... + 680678.
It is an arithmetic number, because the mean of its divisors is an integer number (1502424000).
Almost surely, 232013121131 is an apocalyptic number.
32013121131 is a deficient number, since it is larger than the sum of its proper divisors (16064446869).
32013121131 is a wasteful number, since it uses less digits than its factorization.
32013121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49120 (or 49114 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 32013121131 its reverse (13112131023), we get a palindrome (45125252154).
The spelling of 32013121131 in words is "thirty-two billion, thirteen million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •