Base | Representation |
---|---|
bin | 111101000100110000… |
… | …1010111011000111001 |
3 | 110112112111121112020121 |
4 | 1322021201113120321 |
5 | 4122101444302100 |
6 | 140130301253241 |
7 | 12322113452122 |
oct | 1721141273071 |
9 | 415474545217 |
10 | 131156244025 |
11 | 5069430a404 |
12 | 21503b64221 |
13 | c4a25b89b1 |
14 | 64c2c89049 |
15 | 362960951a |
hex | 1e89857639 |
131156244025 has 9 divisors (see below), whose sum is σ = 162635987983. Its totient is φ = 104923546600.
The previous prime is 131156243909. The next prime is 131156244041. The reversal of 131156244025 is 520442651131.
The square root of 131156244025 is 362155.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 47216247849 + 83939996176 = 217293^2 + 289724^2 .
It is not a de Polignac number, because 131156244025 - 29 = 131156243513 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 8 ways as a sum of consecutive naturals, for example, 1774560 + ... + 1846990.
Almost surely, 2131156244025 is an apocalyptic number.
131156244025 is the 362155-th square number.
131156244025 is the 181078-th centered octagonal number.
It is an amenable number.
131156244025 is a deficient number, since it is larger than the sum of its proper divisors (31479743958).
131156244025 is an frugal number, since it uses more digits than its factorization.
131156244025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144872 (or 72436 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 131156244025 its reverse (520442651131), we get a palindrome (651598895156).
The spelling of 131156244025 in words is "one hundred thirty-one billion, one hundred fifty-six million, two hundred forty-four thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •