Base | Representation |
---|---|
bin | 111101000000011001… |
… | …1011111100010000111 |
3 | 110112011022102121120102 |
4 | 1322000303133202013 |
5 | 4121302030013111 |
6 | 140103554554315 |
7 | 12315356430530 |
oct | 1720063374207 |
9 | 415138377512 |
10 | 131010001031 |
11 | 50619803928 |
12 | 21482b9899b |
13 | c47b203b90 |
14 | 64ab69b687 |
15 | 361b86d13b |
hex | 1e80cdf887 |
131010001031 has 16 divisors (see below), whose sum is σ = 162750034944. Its totient is φ = 102687506784.
The previous prime is 131010001007. The next prime is 131010001049. The reversal of 131010001031 is 130100010131.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 131010001031 - 26 = 131010000967 is a prime.
It is a super-2 number, since 2×1310100010312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131010001081) 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 15 ways as a sum of consecutive naturals, for example, 6717695 + ... + 6737168.
It is an arithmetic number, because the mean of its divisors is an integer number (10171877184).
Almost surely, 2131010001031 is an apocalyptic number.
131010001031 is a deficient number, since it is larger than the sum of its proper divisors (31740033913).
131010001031 is a wasteful number, since it uses less digits than its factorization.
131010001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13454990.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 131010001031 its reverse (130100010131), we get a palindrome (261110011162).
The spelling of 131010001031 in words is "one hundred thirty-one billion, ten million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •