Base | Representation |
---|---|
bin | 111101000011001011… |
… | …1000011101010010101 |
3 | 110112101210211010102101 |
4 | 1322012113003222111 |
5 | 4121444410211013 |
6 | 140121124442101 |
7 | 12320600620300 |
oct | 1720627035225 |
9 | 415353733371 |
10 | 131103210133 |
11 | 50667387245 |
12 | 214aa249331 |
13 | c49460a6ac |
14 | 64b9c01b37 |
15 | 3624b308dd |
hex | 1e865c3a95 |
131103210133 has 48 divisors (see below), whose sum is σ = 161983632384. Its totient is φ = 105571952640.
The previous prime is 131103210019. The next prime is 131103210157. The reversal of 131103210133 is 331012301131.
It is not a de Polignac number, because 131103210133 - 217 = 131103079061 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 131103210133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131103216133) 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 47 ways as a sum of consecutive naturals, for example, 83664316 + ... + 83665882.
It is an arithmetic number, because the mean of its divisors is an integer number (3374659008).
Almost surely, 2131103210133 is an apocalyptic number.
It is an amenable number.
131103210133 is a deficient number, since it is larger than the sum of its proper divisors (30880422251).
131103210133 is a wasteful number, since it uses less digits than its factorization.
131103210133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2882 (or 2875 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 131103210133 its reverse (331012301131), we get a palindrome (462115511264).
The spelling of 131103210133 in words is "one hundred thirty-one billion, one hundred three million, two hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •