Base | Representation |
---|---|
bin | 111101000110011001… |
… | …0101011001001000111 |
3 | 110112200022212011101000 |
4 | 1322030302223021013 |
5 | 4122210021104111 |
6 | 140135541304343 |
7 | 12323351026065 |
oct | 1721462531107 |
9 | 415608764330 |
10 | 131211113031 |
11 | 50712286299 |
12 | 2151a4050b3 |
13 | c4b0a8a36b |
14 | 64ca28d035 |
15 | 362e346c56 |
hex | 1e8ccab247 |
131211113031 has 64 divisors (see below), whose sum is σ = 203419008000. Its totient is φ = 83482358400.
The previous prime is 131211113029. The next prime is 131211113051. The reversal of 131211113031 is 130311112131.
It is not a de Polignac number, because 131211113031 - 21 = 131211113029 is a prime.
It is a super-2 number, since 2×1312111130312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 131211112995 and 131211113013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131211113051) 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 63 ways as a sum of consecutive naturals, for example, 69829350 + ... + 69831228.
It is an arithmetic number, because the mean of its divisors is an integer number (3178422000).
Almost surely, 2131211113031 is an apocalyptic number.
131211113031 is a deficient number, since it is larger than the sum of its proper divisors (72207894969).
131211113031 is a wasteful number, since it uses less digits than its factorization.
131211113031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2901 (or 2895 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 131211113031 its reverse (130311112131), we get a palindrome (261522225162).
The spelling of 131211113031 in words is "one hundred thirty-one billion, two hundred eleven million, one hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •