Base | Representation |
---|---|
bin | 11010001101111000011111… |
… | …011111010111000011100101 |
3 | 120010020212202200020022101211 |
4 | 122031320133133113003211 |
5 | 110103111443401434023 |
6 | 1045121322420351421 |
7 | 33200245200622453 |
oct | 3215703737270345 |
9 | 503225680208354 |
10 | 115303220343013 |
11 | 33814903a3135a |
12 | 10b22653245571 |
13 | 4c4507c406421 |
14 | 20689c43cb9d3 |
15 | d4e47c1ada0d |
hex | 68de1f7d70e5 |
115303220343013 has 2 divisors, whose sum is σ = 115303220343014. Its totient is φ = 115303220343012.
The previous prime is 115303220343001. The next prime is 115303220343079. The reversal of 115303220343013 is 310343022303511.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82889407427044 + 32413812915969 = 9104362^2 + 5693313^2 .
It is a cyclic number.
It is not a de Polignac number, because 115303220343013 - 29 = 115303220342501 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115303220373013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57651610171506 + 57651610171507.
It is an arithmetic number, because the mean of its divisors is an integer number (57651610171507).
Almost surely, 2115303220343013 is an apocalyptic number.
It is an amenable number.
115303220343013 is a deficient number, since it is larger than the sum of its proper divisors (1).
115303220343013 is an equidigital number, since it uses as much as digits as its factorization.
115303220343013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 19440, while the sum is 31.
Adding to 115303220343013 its reverse (310343022303511), we get a palindrome (425646242646524).
The spelling of 115303220343013 in words is "one hundred fifteen trillion, three hundred three billion, two hundred twenty million, three hundred forty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •