Base | Representation |
---|---|
bin | 1010010010111111100101… |
… | …0010111100001100100101 |
3 | 1111002022120022120100112222 |
4 | 2210233321102330030211 |
5 | 2440442232324120101 |
6 | 40024553353522125 |
7 | 2245642242250643 |
oct | 244577122741445 |
9 | 44068508510488 |
10 | 11321421316901 |
11 | 367542a2036a3 |
12 | 132a201113345 |
13 | 6417b42309b7 |
14 | 2b1d61660193 |
15 | 14976978a01b |
hex | a4bf94bc325 |
11321421316901 has 2 divisors, whose sum is σ = 11321421316902. Its totient is φ = 11321421316900.
The previous prime is 11321421316879. The next prime is 11321421316937. The reversal of 11321421316901 is 10961312412311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9068975652676 + 2252445664225 = 3011474^2 + 1500815^2 .
It is an emirp because it is prime and its reverse (10961312412311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11321421316901 - 214 = 11321421300517 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11321421316951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660710658450 + 5660710658451.
It is an arithmetic number, because the mean of its divisors is an integer number (5660710658451).
Almost surely, 211321421316901 is an apocalyptic number.
It is an amenable number.
11321421316901 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321421316901 is an equidigital number, since it uses as much as digits as its factorization.
11321421316901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 35.
The spelling of 11321421316901 in words is "eleven trillion, three hundred twenty-one billion, four hundred twenty-one million, three hundred sixteen thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •