Base | Representation |
---|---|
bin | 111101000000110101… |
… | …0011111110100100011 |
3 | 110112012022120011212011 |
4 | 1322001222133310203 |
5 | 4121314222421011 |
6 | 140105232013351 |
7 | 12315623123653 |
oct | 1720152376443 |
9 | 415168504764 |
10 | 131024420131 |
11 | 50626962140 |
12 | 21487991257 |
13 | c4811b1ca7 |
14 | 64ad572363 |
15 | 361cc6a621 |
hex | 1e81a9fd23 |
131024420131 has 8 divisors (see below), whose sum is σ = 143210086128. Its totient is φ = 118884480000.
The previous prime is 131024420089. The next prime is 131024420141.
131024420131 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 131024420131 - 215 = 131024387363 is a prime.
It is a super-2 number, since 2×1310244201312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131024420141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11425470 + ... + 11436931.
It is an arithmetic number, because the mean of its divisors is an integer number (17901260766).
Almost surely, 2131024420131 is an apocalyptic number.
131024420131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
131024420131 is a deficient number, since it is larger than the sum of its proper divisors (12185665997).
131024420131 is a wasteful number, since it uses less digits than its factorization.
131024420131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22862933.
The product of its (nonzero) digits is 576, while the sum is 22.
It can be divided in two parts, 131024 and 420131, that added together give a palindrome (551155).
The spelling of 131024420131 in words is "one hundred thirty-one billion, twenty-four million, four hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •