Base | Representation |
---|---|
bin | 1001010000100011001… |
… | …1000000111000010001 |
3 | 120012120021001100021101 |
4 | 2110020303000320101 |
5 | 10101224203140000 |
6 | 201023301224401 |
7 | 14330455266400 |
oct | 2241063007021 |
9 | 505507040241 |
10 | 159061380625 |
11 | 61504003574 |
12 | 269b1402101 |
13 | 11ccb970c44 |
14 | 79acdc3637 |
15 | 420e382e6a |
hex | 2508cc0e11 |
159061380625 has 135 divisors (see below), whose sum is σ = 241266959703. Its totient is φ = 104524056000.
The previous prime is 159061380607. The next prime is 159061380631. The reversal of 159061380625 is 526083160951.
The square root of 159061380625 is 398825.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 88260685569 + 70800695056 = 297087^2 + 266084^2 .
It is not a de Polignac number, because 159061380625 - 27 = 159061380497 is a prime.
It is a super-2 number, since 2×1590613806252 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 134 ways as a sum of consecutive naturals, for example, 3001158099 + ... + 3001158151.
Almost surely, 2159061380625 is an apocalyptic number.
159061380625 is the 398825-th square number.
159061380625 is the 199413-rd centered octagonal number.
It is an amenable number.
159061380625 is a deficient number, since it is larger than the sum of its proper divisors (82205579078).
159061380625 is an frugal number, since it uses more digits than its factorization.
159061380625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226 (or 108 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 46.
The spelling of 159061380625 in words is "one hundred fifty-nine billion, sixty-one million, three hundred eighty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •