Base | Representation |
---|---|
bin | 111101001001111100… |
… | …0111111110100111011 |
3 | 110112222121221222020202 |
4 | 1322103320333310323 |
5 | 4122431013224011 |
6 | 140155434112415 |
7 | 12326325242630 |
oct | 1722370776473 |
9 | 415877858222 |
10 | 131330211131 |
11 | 50773531479 |
12 | 2155227b70b |
13 | c4cc659902 |
14 | 64dc012187 |
15 | 3639a2023b |
hex | 1e93e3fd3b |
131330211131 has 8 divisors (see below), whose sum is σ = 150101952000. Its totient is φ = 112561040808.
The previous prime is 131330211119. The next prime is 131330211143. The reversal of 131330211131 is 131112033131.
It is an interprime number because it is at equal distance from previous prime (131330211119) and next prime (131330211143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131330211131 - 222 = 131326016827 is a prime.
It is a super-2 number, since 2×1313302111312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131330210131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 531881 + ... + 738618.
It is an arithmetic number, because the mean of its divisors is an integer number (18762744000).
Almost surely, 2131330211131 is an apocalyptic number.
131330211131 is a deficient number, since it is larger than the sum of its proper divisors (18771740869).
131330211131 is a wasteful number, since it uses less digits than its factorization.
131330211131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1285273.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 131330211131 its reverse (131112033131), we get a palindrome (262442244262).
The spelling of 131330211131 in words is "one hundred thirty-one billion, three hundred thirty million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •