Base | Representation |
---|---|
bin | 111101000000011011… |
… | …1110001111100010111 |
3 | 110112011101112201101110 |
4 | 1322000313301330113 |
5 | 4121302322000030 |
6 | 140104035030103 |
7 | 12315402121461 |
oct | 1720067617427 |
9 | 415141481343 |
10 | 131011125015 |
11 | 5061a401341 |
12 | 2148343b333 |
13 | c47b508664 |
14 | 64ab8b1131 |
15 | 361b9e11b0 |
hex | 1e80df1f17 |
131011125015 has 32 divisors (see below), whose sum is σ = 214180392960. Its totient is φ = 68353161984.
The previous prime is 131011125001. The next prime is 131011125019. The reversal of 131011125015 is 510521110131.
It is not a de Polignac number, because 131011125015 - 25 = 131011124983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131011124982 and 131011125000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131011125019) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1463106 + ... + 1550064.
It is an arithmetic number, because the mean of its divisors is an integer number (6693137280).
Almost surely, 2131011125015 is an apocalyptic number.
131011125015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
131011125015 is a deficient number, since it is larger than the sum of its proper divisors (83169267945).
131011125015 is a wasteful number, since it uses less digits than its factorization.
131011125015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89151.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 131011125015 its reverse (510521110131), we get a palindrome (641532235146).
The spelling of 131011125015 in words is "one hundred thirty-one billion, eleven million, one hundred twenty-five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •