Base | Representation |
---|---|
bin | 1010010010111111100101… |
… | …0010111101001100110101 |
3 | 1111002022120022120120012021 |
4 | 2210233321102331030311 |
5 | 2440442232324233023 |
6 | 40024553353553141 |
7 | 2245642242265636 |
oct | 244577122751465 |
9 | 44068508516167 |
10 | 11321421321013 |
11 | 367542a2067a1 |
12 | 132a2011157b1 |
13 | 6417b423282b |
14 | 2b1d6166188d |
15 | 14976978b35d |
hex | a4bf94bd335 |
11321421321013 has 2 divisors, whose sum is σ = 11321421321014. Its totient is φ = 11321421321012.
The previous prime is 11321421320939. The next prime is 11321421321029. The reversal of 11321421321013 is 31012312412311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9563296481764 + 1758124839249 = 3092458^2 + 1325943^2 .
It is a cyclic number.
It is not a de Polignac number, because 11321421321013 - 237 = 11183982367541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11321421321313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660710660506 + 5660710660507.
It is an arithmetic number, because the mean of its divisors is an integer number (5660710660507).
Almost surely, 211321421321013 is an apocalyptic number.
It is an amenable number.
11321421321013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321421321013 is an equidigital number, since it uses as much as digits as its factorization.
11321421321013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 25.
Adding to 11321421321013 its reverse (31012312412311), we get a palindrome (42333733733324).
The spelling of 11321421321013 in words is "eleven trillion, three hundred twenty-one billion, four hundred twenty-one million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •