Base | Representation |
---|---|
bin | 11101110010110000001010… |
… | …110001100001010101001111 |
3 | 122011221110000200100112020110 |
4 | 131302300022301201111033 |
5 | 114133303034003120421 |
6 | 1142402455152051103 |
7 | 36412452252604353 |
oct | 3562601261412517 |
9 | 564843020315213 |
10 | 131031043020111 |
11 | 38828a538a3643 |
12 | 1284283b233a93 |
13 | 5816236036380 |
14 | 244dd17399463 |
15 | 10236412b6a76 |
hex | 772c0ac6154f |
131031043020111 has 32 divisors (see below), whose sum is σ = 198050776161280. Its totient is φ = 76390121520000.
The previous prime is 131031043020109. The next prime is 131031043020127. The reversal of 131031043020111 is 111020340130131.
It is not a de Polignac number, because 131031043020111 - 21 = 131031043020109 is a prime.
It is a super-2 number, since 2×1310310430201112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131031043020151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 160204581 + ... + 161020401.
It is an arithmetic number, because the mean of its divisors is an integer number (6189086755040).
Almost surely, 2131031043020111 is an apocalyptic number.
131031043020111 is a deficient number, since it is larger than the sum of its proper divisors (67019733141169).
131031043020111 is a wasteful number, since it uses less digits than its factorization.
131031043020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1032607.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 131031043020111 its reverse (111020340130131), we get a palindrome (242051383150242).
The spelling of 131031043020111 in words is "one hundred thirty-one trillion, thirty-one billion, forty-three million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •