Base | Representation |
---|---|
bin | 1010010010011001111000… |
… | …1101000101010111000001 |
3 | 1111001100110011101201012111 |
4 | 2210212132031011113001 |
5 | 2440311022044322241 |
6 | 40020201345455321 |
7 | 2245133431065361 |
oct | 244463615052701 |
9 | 44040404351174 |
10 | 11311303120321 |
11 | 36711077a9866 |
12 | 1328258641541 |
13 | 640860bcb429 |
14 | 2b16819309a1 |
15 | 149376330c81 |
hex | a499e3455c1 |
11311303120321 has 2 divisors, whose sum is σ = 11311303120322. Its totient is φ = 11311303120320.
The previous prime is 11311303120303. The next prime is 11311303120399. The reversal of 11311303120321 is 12302130311311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9637671891600 + 1673631228721 = 3104460^2 + 1293689^2 .
It is a cyclic number.
It is not a de Polignac number, because 11311303120321 - 223 = 11311294731713 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11311303120292 and 11311303120301.
It is not a weakly prime, because it can be changed into another prime (11311303120121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655651560160 + 5655651560161.
It is an arithmetic number, because the mean of its divisors is an integer number (5655651560161).
Almost surely, 211311303120321 is an apocalyptic number.
It is an amenable number.
11311303120321 is a deficient number, since it is larger than the sum of its proper divisors (1).
11311303120321 is an equidigital number, since it uses as much as digits as its factorization.
11311303120321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11311303120321 its reverse (12302130311311), we get a palindrome (23613433431632).
The spelling of 11311303120321 in words is "eleven trillion, three hundred eleven billion, three hundred three million, one hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •