Base | Representation |
---|---|
bin | 1010010001110100010111… |
… | …1011100100100110101101 |
3 | 1111000101110022011221211121 |
4 | 2210131011323210212231 |
5 | 2440124410420400414 |
6 | 40011414151020541 |
7 | 2244326032505065 |
oct | 244350573444655 |
9 | 44011408157747 |
10 | 11301232200109 |
11 | 3667909a55405 |
12 | 132630796a751 |
13 | 63c91760c647 |
14 | 2b0da81ca3a5 |
15 | 148e87114724 |
hex | a4745ee49ad |
11301232200109 has 2 divisors, whose sum is σ = 11301232200110. Its totient is φ = 11301232200108.
The previous prime is 11301232200017. The next prime is 11301232200149. The reversal of 11301232200109 is 90100223210311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6975884616100 + 4325347584009 = 2641190^2 + 2079747^2 .
It is a cyclic number.
It is not a de Polignac number, because 11301232200109 - 221 = 11301230102957 is a prime.
It is a super-2 number, since 2×113012322001092 (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 (11301232200149) 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, 5650616100054 + 5650616100055.
It is an arithmetic number, because the mean of its divisors is an integer number (5650616100055).
Almost surely, 211301232200109 is an apocalyptic number.
It is an amenable number.
11301232200109 is a deficient number, since it is larger than the sum of its proper divisors (1).
11301232200109 is an equidigital number, since it uses as much as digits as its factorization.
11301232200109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 11301232200109 in words is "eleven trillion, three hundred one billion, two hundred thirty-two million, two hundred thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •