Base | Representation |
---|---|
bin | 1011110110100011111111… |
… | …0110110100001010110011 |
3 | 1201010211212122010011102200 |
4 | 2331220333312310022303 |
5 | 3202004020020011011 |
6 | 43414452532514243 |
7 | 2513350106141124 |
oct | 275507766641263 |
9 | 51124778104380 |
10 | 13032002110131 |
11 | 41749284a17a4 |
12 | 156583317b983 |
13 | 736bb2a86164 |
14 | 330a7631804b |
15 | 178ed3e3d856 |
hex | bda3fdb42b3 |
13032002110131 has 12 divisors (see below), whose sum is σ = 19642437963408. Its totient is φ = 8310262215024.
The previous prime is 13032002110129. The next prime is 13032002110147. The reversal of 13032002110131 is 13101120023031.
13032002110131 is a `hidden beast` number, since 1 + 3 + 0 + 320 + 0 + 211 + 0 + 131 = 666.
It is not a de Polignac number, because 13032002110131 - 21 = 13032002110129 is a prime.
It is a super-2 number, since 2×130320021101312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13032002110181) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 31478265760 + ... + 31478266173.
It is an arithmetic number, because the mean of its divisors is an integer number (1636869830284).
Almost surely, 213032002110131 is an apocalyptic number.
13032002110131 is a deficient number, since it is larger than the sum of its proper divisors (6610435853277).
13032002110131 is a wasteful number, since it uses less digits than its factorization.
13032002110131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62956531962 (or 62956531959 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 13032002110131 its reverse (13101120023031), we get a palindrome (26133122133162).
The spelling of 13032002110131 in words is "thirteen trillion, thirty-two billion, two million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •