Base | Representation |
---|---|
bin | 1010010010111111001001… |
… | …0001001100110011000101 |
3 | 1111002022021002201120112211 |
4 | 2210233302101030303011 |
5 | 2440442012133420401 |
6 | 40024533542543421 |
7 | 2245636311166333 |
oct | 244576221146305 |
9 | 44068232646484 |
10 | 11321303420101 |
11 | 36753796a9024 |
12 | 132a189737b71 |
13 | 64179599218c |
14 | 2b1d4db30b53 |
15 | 14975e24c951 |
hex | a4bf244ccc5 |
11321303420101 has 2 divisors, whose sum is σ = 11321303420102. Its totient is φ = 11321303420100.
The previous prime is 11321303420083. The next prime is 11321303420137. The reversal of 11321303420101 is 10102430312311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6644918795076 + 4676384625025 = 2577774^2 + 2162495^2 .
It is a cyclic number.
It is not a de Polignac number, because 11321303420101 - 217 = 11321303289029 is a prime.
It is a super-2 number, since 2×113213034201012 (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 (11321303420191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5660651710050 + 5660651710051.
It is an arithmetic number, because the mean of its divisors is an integer number (5660651710051).
Almost surely, 211321303420101 is an apocalyptic number.
It is an amenable number.
11321303420101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11321303420101 is an equidigital number, since it uses as much as digits as its factorization.
11321303420101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 11321303420101 its reverse (10102430312311), we get a palindrome (21423733732412).
The spelling of 11321303420101 in words is "eleven trillion, three hundred twenty-one billion, three hundred three million, four hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •