Base | Representation |
---|---|
bin | 1101110100110… |
… | …01010100100001 |
3 | 22002012221210121 |
4 | 12322121110201 |
5 | 214142040421 |
6 | 15301400241 |
7 | 2605511632 |
oct | 672312441 |
9 | 262187717 |
10 | 115971361 |
11 | 5a510000 |
12 | 32a09081 |
13 | 1b04630c |
14 | 1158b889 |
15 | a2abd41 |
hex | 6e99521 |
115971361 has 15 divisors (see below), whose sum is σ = 129017155. Its totient is φ = 104243920.
The previous prime is 115971353. The next prime is 115971389. The reversal of 115971361 is 163179511.
The square root of 115971361 is 10769.
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., 22268961 + 93702400 = 4719^2 + 9680^2 .
It is not a de Polignac number, because 115971361 - 23 = 115971353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (115971311) by changing a digit.
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 14 ways as a sum of consecutive naturals, for example, 1303005 + ... + 1303093.
Almost surely, 2115971361 is an apocalyptic number.
115971361 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
115971361 is the 10769-th square number.
115971361 is the 5385-th centered octagonal number.
It is an amenable number.
115971361 is a deficient number, since it is larger than the sum of its proper divisors (13045794).
115971361 is an frugal number, since it uses more digits than its factorization.
115971361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222 (or 100 counting only the distinct ones).
The product of its digits is 5670, while the sum is 34.
The cubic root of 115971361 is about 487.6597570644.
The spelling of 115971361 in words is "one hundred fifteen million, nine hundred seventy-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •