Base | Representation |
---|---|
bin | 11010001011011010010000… |
… | …110001000111001100100101 |
3 | 120002122122020011202212001211 |
4 | 122023122100301013030211 |
5 | 110042321020431131323 |
6 | 1044511303520151421 |
7 | 33152052023632132 |
oct | 3213322061071445 |
9 | 502578204685054 |
10 | 115133322130213 |
11 | 33759849906442 |
12 | 10ab5738768571 |
13 | 4c3204459a46a |
14 | 20606a808d589 |
15 | d49d3676c70d |
hex | 68b690c47325 |
115133322130213 has 2 divisors, whose sum is σ = 115133322130214. Its totient is φ = 115133322130212.
The previous prime is 115133322130193. The next prime is 115133322130261. The reversal of 115133322130213 is 312031223331511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110967220673604 + 4166101456609 = 10534098^2 + 2041103^2 .
It is a cyclic number.
It is not a de Polignac number, because 115133322130213 - 229 = 115132785259301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115133322131213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57566661065106 + 57566661065107.
It is an arithmetic number, because the mean of its divisors is an integer number (57566661065107).
Almost surely, 2115133322130213 is an apocalyptic number.
It is an amenable number.
115133322130213 is a deficient number, since it is larger than the sum of its proper divisors (1).
115133322130213 is an equidigital number, since it uses as much as digits as its factorization.
115133322130213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 31.
Adding to 115133322130213 its reverse (312031223331511), we get a palindrome (427164545461724).
The spelling of 115133322130213 in words is "one hundred fifteen trillion, one hundred thirty-three billion, three hundred twenty-two million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •