Base | Representation |
---|---|
bin | 1101110000011… |
… | …00100111100001 |
3 | 22001010200020102 |
4 | 12320030213201 |
5 | 214020120131 |
6 | 15241152145 |
7 | 2600561456 |
oct | 670144741 |
9 | 261120212 |
10 | 115395041 |
11 | 5a157003 |
12 | 3278b655 |
13 | 1aba3bb8 |
14 | 1147b82d |
15 | a1e61cb |
hex | 6e0c9e1 |
115395041 has 2 divisors, whose sum is σ = 115395042. Its totient is φ = 115395040.
The previous prime is 115395029. The next prime is 115395043. The reversal of 115395041 is 140593511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98585041 + 16810000 = 9929^2 + 4100^2 .
It is an emirp because it is prime and its reverse (140593511) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 115395041 - 210 = 115394017 is a prime.
Together with 115395043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 115394995 and 115395013.
It is not a weakly prime, because it can be changed into another prime (115395043) 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 as a sum of consecutive naturals, namely, 57697520 + 57697521.
It is an arithmetic number, because the mean of its divisors is an integer number (57697521).
Almost surely, 2115395041 is an apocalyptic number.
It is an amenable number.
115395041 is a deficient number, since it is larger than the sum of its proper divisors (1).
115395041 is an equidigital number, since it uses as much as digits as its factorization.
115395041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 29.
The square root of 115395041 is about 10742.2083856161. The cubic root of 115395041 is about 486.8506063835.
The spelling of 115395041 in words is "one hundred fifteen million, three hundred ninety-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •