Base | Representation |
---|---|
bin | 1010010010111011001001… |
… | …1110010111100101000101 |
3 | 1111002012111111210012222011 |
4 | 2210232302132113211011 |
5 | 2440432314140132214 |
6 | 40024235430534221 |
7 | 2245600633654045 |
oct | 244566236274505 |
9 | 44065444705864 |
10 | 11320233130309 |
11 | 367497a536504 |
12 | 1329b2b207371 |
13 | 6416550145cc |
14 | 2b1c8b927725 |
15 | 1496ea2d4ac4 |
hex | a4bb2797945 |
11320233130309 has 2 divisors, whose sum is σ = 11320233130310. Its totient is φ = 11320233130308.
The previous prime is 11320233130307. The next prime is 11320233130387. The reversal of 11320233130309 is 90303133202311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9584287222500 + 1735945907809 = 3095850^2 + 1317553^2 .
It is a cyclic number.
It is not a de Polignac number, because 11320233130309 - 21 = 11320233130307 is a prime.
Together with 11320233130307, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11320233130307) 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, 5660116565154 + 5660116565155.
It is an arithmetic number, because the mean of its divisors is an integer number (5660116565155).
Almost surely, 211320233130309 is an apocalyptic number.
It is an amenable number.
11320233130309 is a deficient number, since it is larger than the sum of its proper divisors (1).
11320233130309 is an equidigital number, since it uses as much as digits as its factorization.
11320233130309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 31.
The spelling of 11320233130309 in words is "eleven trillion, three hundred twenty billion, two hundred thirty-three million, one hundred thirty thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •