Base | Representation |
---|---|
bin | 110101100110100110… |
… | …1111101111000100111 |
3 | 102000010100210121112201 |
4 | 1223031031331320213 |
5 | 3341222201442302 |
6 | 124514244355331 |
7 | 11213405022442 |
oct | 1531515757047 |
9 | 360110717481 |
10 | 115112140327 |
11 | 44900890878 |
12 | 1a3869a5b47 |
13 | ab16660102 |
14 | 5800116659 |
15 | 2edad00c87 |
hex | 1acd37de27 |
115112140327 has 2 divisors, whose sum is σ = 115112140328. Its totient is φ = 115112140326.
The previous prime is 115112140301. The next prime is 115112140361. The reversal of 115112140327 is 723041211511.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 115112140327 - 215 = 115112107559 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 115112140295 and 115112140304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115112140027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57556070163 + 57556070164.
It is an arithmetic number, because the mean of its divisors is an integer number (57556070164).
Almost surely, 2115112140327 is an apocalyptic number.
115112140327 is a deficient number, since it is larger than the sum of its proper divisors (1).
115112140327 is an equidigital number, since it uses as much as digits as its factorization.
115112140327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 28.
Adding to 115112140327 its reverse (723041211511), we get a palindrome (838153351838).
The spelling of 115112140327 in words is "one hundred fifteen billion, one hundred twelve million, one hundred forty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •