Base | Representation |
---|---|
bin | 1101101110111… |
… | …01010011011001 |
3 | 22000202211101122 |
4 | 12313131103121 |
5 | 213442414431 |
6 | 15233055025 |
7 | 2566123451 |
oct | 667352331 |
9 | 260684348 |
10 | 115201241 |
11 | 5a034441 |
12 | 326b7475 |
13 | 1ab3691c |
14 | 1142ad61 |
15 | a1a8a7b |
hex | 6ddd4d9 |
115201241 has 2 divisors, whose sum is σ = 115201242. Its totient is φ = 115201240.
The previous prime is 115201223. The next prime is 115201259. The reversal of 115201241 is 142102511.
It is a balanced prime because it is at equal distance from previous prime (115201223) and next prime (115201259).
It can be written as a sum of positive squares in only one way, i.e., 57760000 + 57441241 = 7600^2 + 7579^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115201241 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (115201201) by changing a digit.
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 as a sum of consecutive naturals, namely, 57600620 + 57600621.
It is an arithmetic number, because the mean of its divisors is an integer number (57600621).
Almost surely, 2115201241 is an apocalyptic number.
It is an amenable number.
115201241 is a deficient number, since it is larger than the sum of its proper divisors (1).
115201241 is an equidigital number, since it uses as much as digits as its factorization.
115201241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 115201241 is about 10733.1841035175. The cubic root of 115201241 is about 486.5779068648.
Adding to 115201241 its reverse (142102511), we get a palindrome (257303752).
The spelling of 115201241 in words is "one hundred fifteen million, two hundred one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •