Base | Representation |
---|---|
bin | 11001101101110101110100… |
… | …001100000011001010100001 |
3 | 112211110101021200010221000222 |
4 | 121231311310030003022201 |
5 | 104311023002204340223 |
6 | 1040314010333252425 |
7 | 32552205136221662 |
oct | 3155656414031241 |
9 | 484411250127028 |
10 | 113101323121313 |
11 | 330460023a165a |
12 | 10827964334115 |
13 | 4b15541782ac7 |
14 | 1dd01c18b7369 |
15 | d120593ec0c8 |
hex | 66dd743032a1 |
113101323121313 has 2 divisors, whose sum is σ = 113101323121314. Its totient is φ = 113101323121312.
The previous prime is 113101323121301. The next prime is 113101323121333. The reversal of 113101323121313 is 313121323101311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110789792102929 + 2311531018384 = 10525673^2 + 1520372^2 .
It is a cyclic number.
It is not a de Polignac number, because 113101323121313 - 212 = 113101323117217 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (113101323121333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56550661560656 + 56550661560657.
It is an arithmetic number, because the mean of its divisors is an integer number (56550661560657).
Almost surely, 2113101323121313 is an apocalyptic number.
It is an amenable number.
113101323121313 is a deficient number, since it is larger than the sum of its proper divisors (1).
113101323121313 is an equidigital number, since it uses as much as digits as its factorization.
113101323121313 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 26.
Adding to 113101323121313 its reverse (313121323101311), we get a palindrome (426222646222624).
The spelling of 113101323121313 in words is "one hundred thirteen trillion, one hundred one billion, three hundred twenty-three million, one hundred twenty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •