Base | Representation |
---|---|
bin | 1010001101101111110111… |
… | …0110000010011011001101 |
3 | 1110202200221211122102122112 |
4 | 2203123331312002123031 |
5 | 2433003202122004401 |
6 | 35515331200153405 |
7 | 2236302110665664 |
oct | 243337566023315 |
9 | 43680854572575 |
10 | 11231303313101 |
11 | 3640194a14603 |
12 | 1314850908865 |
13 | 636151b332b1 |
14 | 2ab852c05ddb |
15 | 147242d9e3bb |
hex | a36fdd826cd |
11231303313101 has 2 divisors, whose sum is σ = 11231303313102. Its totient is φ = 11231303313100.
The previous prime is 11231303313053. The next prime is 11231303313127. The reversal of 11231303313101 is 10131330313211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7963430022025 + 3267873291076 = 2821955^2 + 1807726^2 .
It is a cyclic number.
It is not a de Polignac number, because 11231303313101 - 230 = 11230229571277 is a prime.
It is a super-2 number, since 2×112313033131012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11231303313401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5615651656550 + 5615651656551.
It is an arithmetic number, because the mean of its divisors is an integer number (5615651656551).
Almost surely, 211231303313101 is an apocalyptic number.
It is an amenable number.
11231303313101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11231303313101 is an equidigital number, since it uses as much as digits as its factorization.
11231303313101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 11231303313101 its reverse (10131330313211), we get a palindrome (21362633626312).
The spelling of 11231303313101 in words is "eleven trillion, two hundred thirty-one billion, three hundred three million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •