Base | Representation |
---|---|
bin | 111101010000101001… |
… | …0001011101010100001 |
3 | 110120120021210012210021 |
4 | 1322201102023222201 |
5 | 4123411024321100 |
6 | 140234022233441 |
7 | 12335024226100 |
oct | 1724122135241 |
9 | 416507705707 |
10 | 131554917025 |
11 | 50879359324 |
12 | 215b5585881 |
13 | c53708428c |
14 | 651dbc6037 |
15 | 364e609a1a |
hex | 1ea148baa1 |
131554917025 has 81 divisors (see below), whose sum is σ = 195086410713. Its totient is φ = 87745593600.
The previous prime is 131554917017. The next prime is 131554917037. The reversal of 131554917025 is 520719455131.
The square root of 131554917025 is 362705.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 1957797009 + 129597120016 = 44247^2 + 359996^2 .
It is not a de Polignac number, because 131554917025 - 23 = 131554917017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (43).
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 545870905 + ... + 545871145.
Almost surely, 2131554917025 is an apocalyptic number.
131554917025 is the 362705-th square number.
131554917025 is the 181353-rd centered octagonal number.
It is an amenable number.
131554917025 is a deficient number, since it is larger than the sum of its proper divisors (63531493688).
131554917025 is an frugal number, since it uses more digits than its factorization.
131554917025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592 (or 296 counting only the distinct ones).
The product of its (nonzero) digits is 189000, while the sum is 43.
The spelling of 131554917025 in words is "one hundred thirty-one billion, five hundred fifty-four million, nine hundred seventeen thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •