Base | Representation |
---|---|
bin | 1010010011000110010010… |
… | …0001111001111110110101 |
3 | 1111002111012200212100111011 |
4 | 2210301210201321332311 |
5 | 2441004423410331401 |
6 | 40025452102312221 |
7 | 2246034646235206 |
oct | 244614441717665 |
9 | 44074180770434 |
10 | 11323220402101 |
11 | 36761727a2a73 |
12 | 132a623728671 |
13 | 641a0cb9055a |
14 | 2b20925795ad |
15 | 1498226b2451 |
hex | a4c64879fb5 |
11323220402101 has 2 divisors, whose sum is σ = 11323220402102. Its totient is φ = 11323220402100.
The previous prime is 11323220402077. The next prime is 11323220402111. The reversal of 11323220402101 is 10120402232311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7571247528100 + 3751972874001 = 2751590^2 + 1937001^2 .
It is a cyclic number.
It is not a de Polignac number, because 11323220402101 - 29 = 11323220401589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11323220402111) 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, 5661610201050 + 5661610201051.
It is an arithmetic number, because the mean of its divisors is an integer number (5661610201051).
Almost surely, 211323220402101 is an apocalyptic number.
It is an amenable number.
11323220402101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11323220402101 is an equidigital number, since it uses as much as digits as its factorization.
11323220402101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 11323220402101 its reverse (10120402232311), we get a palindrome (21443622634412).
The spelling of 11323220402101 in words is "eleven trillion, three hundred twenty-three billion, two hundred twenty million, four hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •