Base | Representation |
---|---|
bin | 11010010111110001010001… |
… | …110001001111110101111001 |
3 | 120012122211112121020101002101 |
4 | 122113301101301033311321 |
5 | 110200230001143210000 |
6 | 1050401411421303401 |
7 | 33300320436603232 |
oct | 3227612161176571 |
9 | 505584477211071 |
10 | 115982668725625 |
11 | 33a56a78919699 |
12 | 11012275104b61 |
13 | 4c94170b10000 |
14 | 208d83c05a089 |
15 | d61e96d87e6a |
hex | 697c51c4fd79 |
115982668725625 has 75 divisors (see below), whose sum is σ = 157070802418871. Its totient is φ = 85615139064000.
The previous prime is 115982668725617. The next prime is 115982668725631. The reversal of 115982668725625 is 526527866289511.
The square root of 115982668725625 is 10769525.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 37 ways, for example, as 5904885420009 + 110077783305616 = 2429997^2 + 10491796^2 .
It is not a de Polignac number, because 115982668725625 - 23 = 115982668725617 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 74 ways as a sum of consecutive naturals, for example, 45501241851 + ... + 45501244399.
Almost surely, 2115982668725625 is an apocalyptic number.
115982668725625 is the 10769525-th square number.
115982668725625 is the 5384763-rd centered octagonal number.
It is an amenable number.
115982668725625 is a deficient number, since it is larger than the sum of its proper divisors (41088133693246).
115982668725625 is an frugal number, since it uses more digits than its factorization.
115982668725625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5170 (or 2567 counting only the distinct ones).
The product of its digits is 870912000, while the sum is 73.
The spelling of 115982668725625 in words is "one hundred fifteen trillion, nine hundred eighty-two billion, six hundred sixty-eight million, seven hundred twenty-five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •