Base | Representation |
---|---|
bin | 110101100111011100… |
… | …1000000101001010111 |
3 | 102000012022121020121122 |
4 | 1223032321000221113 |
5 | 3341301342413142 |
6 | 124521130034155 |
7 | 11214165363224 |
oct | 1531671005127 |
9 | 360168536548 |
10 | 115140201047 |
11 | 44915707253 |
12 | 1a39427895b |
13 | ab1c4064a1 |
14 | 5803b3c94b |
15 | 2edd4e51d2 |
hex | 1acee40a57 |
115140201047 has 2 divisors, whose sum is σ = 115140201048. Its totient is φ = 115140201046.
The previous prime is 115140201041. The next prime is 115140201053. The reversal of 115140201047 is 740102041511.
It is a balanced prime because it is at equal distance from previous prime (115140201041) and next prime (115140201053).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-115140201047 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115140201041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57570100523 + 57570100524.
It is an arithmetic number, because the mean of its divisors is an integer number (57570100524).
Almost surely, 2115140201047 is an apocalyptic number.
115140201047 is a deficient number, since it is larger than the sum of its proper divisors (1).
115140201047 is an equidigital number, since it uses as much as digits as its factorization.
115140201047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 26.
Adding to 115140201047 its reverse (740102041511), we get a palindrome (855242242558).
The spelling of 115140201047 in words is "one hundred fifteen billion, one hundred forty million, two hundred one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •