Base | Representation |
---|---|
bin | 11010001100100100111000… |
… | …110101000100001100110011 |
3 | 120002221022001111122211010021 |
4 | 122030210320311010030303 |
5 | 110100124121443301011 |
6 | 1045012155003144311 |
7 | 33160616503233115 |
oct | 3214447065041463 |
9 | 502838044584107 |
10 | 115213451150131 |
11 | 3378a828625054 |
12 | 10b0917b815097 |
13 | 4c39774366909 |
14 | 206450a0113b5 |
15 | d4be76224471 |
hex | 68c938d44333 |
115213451150131 has 2 divisors, whose sum is σ = 115213451150132. Its totient is φ = 115213451150130.
The previous prime is 115213451150123. The next prime is 115213451150179. The reversal of 115213451150131 is 131051154312511.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 115213451150131 - 23 = 115213451150123 is a prime.
It is a super-2 number, since 2×1152134511501312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (115213451130131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57606725575065 + 57606725575066.
It is an arithmetic number, because the mean of its divisors is an integer number (57606725575066).
Almost surely, 2115213451150131 is an apocalyptic number.
115213451150131 is a deficient number, since it is larger than the sum of its proper divisors (1).
115213451150131 is an equidigital number, since it uses as much as digits as its factorization.
115213451150131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 34.
The spelling of 115213451150131 in words is "one hundred fifteen trillion, two hundred thirteen billion, four hundred fifty-one million, one hundred fifty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •