Base | Representation |
---|---|
bin | 111101001001010110… |
… | …0101011000101001011 |
3 | 110112221020022110112200 |
4 | 1322102230223011023 |
5 | 4122410403000321 |
6 | 140153441211243 |
7 | 12325663211535 |
oct | 1722254530513 |
9 | 415836273480 |
10 | 131310203211 |
11 | 50763206200 |
12 | 21547630b23 |
13 | c4c84729c5 |
14 | 64d94c4855 |
15 | 3637dbbd26 |
hex | 1e92b2b14b |
131310203211 has 72 divisors (see below), whose sum is σ = 211854010368. Its totient is φ = 78299654400.
The previous prime is 131310203179. The next prime is 131310203231. The reversal of 131310203211 is 112302013131.
131310203211 is a `hidden beast` number, since 1 + 31 + 310 + 2 + 0 + 321 + 1 = 666.
It is not a de Polignac number, because 131310203211 - 25 = 131310203179 is a prime.
It is a super-2 number, since 2×1313102032112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131310203231) 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 71 ways as a sum of consecutive naturals, for example, 36646326 + ... + 36649908.
Almost surely, 2131310203211 is an apocalyptic number.
131310203211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131310203211 is a deficient number, since it is larger than the sum of its proper divisors (80543807157).
131310203211 is a wasteful number, since it uses less digits than its factorization.
131310203211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4145 (or 4131 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 131310203211 its reverse (112302013131), we get a palindrome (243612216342).
The spelling of 131310203211 in words is "one hundred thirty-one billion, three hundred ten million, two hundred three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •