Base | Representation |
---|---|
bin | 110101100011101000… |
… | …1010011100010001101 |
3 | 101222212102000211212222 |
4 | 1223013101103202031 |
5 | 3341021130232031 |
6 | 124500321505125 |
7 | 11211053602001 |
oct | 1530721234215 |
9 | 358772024788 |
10 | 115012352141 |
11 | 4485a5244a5 |
12 | 1a3594a21a5 |
13 | aacba91b4b |
14 | 57d0b7c701 |
15 | 2ed218de7b |
hex | 1ac745388d |
115012352141 has 2 divisors, whose sum is σ = 115012352142. Its totient is φ = 115012352140.
The previous prime is 115012352131. The next prime is 115012352179. The reversal of 115012352141 is 141253210511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100384417225 + 14627934916 = 316835^2 + 120946^2 .
It is a cyclic number.
It is not a de Polignac number, because 115012352141 - 226 = 114945243277 is a prime.
It is a super-2 number, since 2×1150123521412 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 115012352141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115012352111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57506176070 + 57506176071.
It is an arithmetic number, because the mean of its divisors is an integer number (57506176071).
Almost surely, 2115012352141 is an apocalyptic number.
It is an amenable number.
115012352141 is a deficient number, since it is larger than the sum of its proper divisors (1).
115012352141 is an equidigital number, since it uses as much as digits as its factorization.
115012352141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 115012352141 its reverse (141253210511), we get a palindrome (256265562652).
The spelling of 115012352141 in words is "one hundred fifteen billion, twelve million, three hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •