Base | Representation |
---|---|
bin | 111101000000011001… |
… | …1100001110000010011 |
3 | 110112011022110002001110 |
4 | 1322000303201300103 |
5 | 4121302030311011 |
6 | 140103555104403 |
7 | 12315356466210 |
oct | 1720063416023 |
9 | 415138402043 |
10 | 131010010131 |
11 | 5061980a750 |
12 | 21482ba2103 |
13 | c47b208070 |
14 | 64ab6a0b07 |
15 | 361b870ba6 |
hex | 1e80ce1c13 |
131010010131 has 128 divisors (see below), whose sum is σ = 247692017664. Its totient is φ = 59364011520.
The previous prime is 131010010121. The next prime is 131010010169.
131010010131 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 131010010131 - 29 = 131010009619 is a prime.
It is a super-2 number, since 2×1310100101312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131010010121) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 5721301 + ... + 5744153.
It is an arithmetic number, because the mean of its divisors is an integer number (1935093888).
Almost surely, 2131010010131 is an apocalyptic number.
131010010131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131010010131 is a deficient number, since it is larger than the sum of its proper divisors (116682007533).
131010010131 is a wasteful number, since it uses less digits than its factorization.
131010010131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22993.
The product of its (nonzero) digits is 9, while the sum is 12.
It can be divided in two parts, 1310100 and 10131, that added together give a palindrome (1320231).
The spelling of 131010010131 in words is "one hundred thirty-one billion, ten million, ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •