Base | Representation |
---|---|
bin | 111101001111100100… |
… | …1010111001000010001 |
3 | 110120110210021222211110 |
4 | 1322133021113020101 |
5 | 4123322334102012 |
6 | 140230301403533 |
7 | 12334110324210 |
oct | 1723711271021 |
9 | 416423258743 |
10 | 131519050257 |
11 | 50860091071 |
12 | 215a55695a9 |
13 | c52c806b3a |
14 | 651912b077 |
15 | 364b3c273c |
hex | 1e9f257211 |
131519050257 has 32 divisors (see below), whose sum is σ = 213500731392. Its totient is φ = 70298959104.
The previous prime is 131519050253. The next prime is 131519050261. The reversal of 131519050257 is 752050915131.
It is an interprime number because it is at equal distance from previous prime (131519050253) and next prime (131519050261).
It is not a de Polignac number, because 131519050257 - 22 = 131519050253 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131519050253) 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 31 ways as a sum of consecutive naturals, for example, 1071873 + ... + 1188254.
It is an arithmetic number, because the mean of its divisors is an integer number (6671897856).
Almost surely, 2131519050257 is an apocalyptic number.
131519050257 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
131519050257 is a deficient number, since it is larger than the sum of its proper divisors (81981681135).
131519050257 is a wasteful number, since it uses less digits than its factorization.
131519050257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2260317.
The product of its (nonzero) digits is 47250, while the sum is 39.
Adding to 131519050257 its reverse (752050915131), we get a palindrome (883569965388).
The spelling of 131519050257 in words is "one hundred thirty-one billion, five hundred nineteen million, fifty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •