Base | Representation |
---|---|
bin | 1110100011101001011000… |
… | …00010000101101011010011 |
3 | 11012100020022200121022002100 |
4 | 13101310230002011223103 |
5 | 13143432243240032011 |
6 | 152025413214451443 |
7 | 6512504433350130 |
oct | 721645402055323 |
9 | 135306280538070 |
10 | 32011130002131 |
11 | a2219313a3205 |
12 | 370bb7a803b83 |
13 | 14b28378176a7 |
14 | 7c94c00ab587 |
15 | 3a7a39e74d56 |
hex | 1d1d2c085ad3 |
32011130002131 has 24 divisors (see below), whose sum is σ = 54665969136480. Its totient is φ = 17661313103616.
The previous prime is 32011130002031. The next prime is 32011130002139. The reversal of 32011130002131 is 13120003111023.
32011130002131 is a `hidden beast` number, since 320 + 1 + 1 + 130 + 0 + 0 + 213 + 1 = 666.
It is not a de Polignac number, because 32011130002131 - 29 = 32011130001619 is a prime.
It is a super-2 number, since 2×320111300021312 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (32011130002139) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8760570150 + ... + 8760573803.
It is an arithmetic number, because the mean of its divisors is an integer number (2277748714020).
Almost surely, 232011130002131 is an apocalyptic number.
32011130002131 is a deficient number, since it is larger than the sum of its proper divisors (22654839134349).
32011130002131 is a wasteful number, since it uses less digits than its factorization.
32011130002131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17521143995 (or 17521143992 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 32011130002131 its reverse (13120003111023), we get a palindrome (45131133113154).
The spelling of 32011130002131 in words is "thirty-two trillion, eleven billion, one hundred thirty million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •