Base | Representation |
---|---|
bin | 110101111111111111… |
… | …1111000011111010001 |
3 | 102002022201212221121111 |
4 | 1223333333320133101 |
5 | 3344443301224400 |
6 | 125135000453321 |
7 | 11243461316641 |
oct | 1537777703721 |
9 | 362281787544 |
10 | 115964086225 |
11 | 451a8781399 |
12 | 1a58417a241 |
13 | ac21000000 |
14 | 5881324521 |
15 | 303a9d93ba |
hex | 1affff87d1 |
115964086225 has 63 divisors (see below), whose sum is σ = 160965630669. Its totient is φ = 82872597600.
The previous prime is 115964086223. The next prime is 115964086237. The reversal of 115964086225 is 522680469511.
It is a happy number.
The square root of 115964086225 is 340535.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 10 ways, for example, as 7496615889 + 108467470336 = 86583^2 + 329344^2 .
It is not a de Polignac number, because 115964086225 - 21 = 115964086223 is a prime.
It is not an unprimeable number, because it can be changed into a prime (115964086223) by changing a digit.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 3740776960 + ... + 3740776990.
Almost surely, 2115964086225 is an apocalyptic number.
115964086225 is the 340535-th square number.
115964086225 is the 170268-th centered octagonal number.
It is an amenable number.
115964086225 is a deficient number, since it is larger than the sum of its proper divisors (45001544444).
115964086225 is an frugal number, since it uses more digits than its factorization.
115964086225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150 (or 49 counting only the distinct ones).
The product of its (nonzero) digits is 1036800, while the sum is 49.
Multiplying 115964086225 by its sum of digits (49), we get a square (5682240225025 = 23837452).
The spelling of 115964086225 in words is "one hundred fifteen billion, nine hundred sixty-four million, eighty-six thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •