Base | Representation |
---|---|
bin | 1010000001000011010111… |
… | …1001001001101001110101 |
3 | 1102222211222212101110201102 |
4 | 2200100311321021221311 |
5 | 2420420013240234031 |
6 | 35231221104135445 |
7 | 2214451241103524 |
oct | 240206571115165 |
9 | 42884885343642 |
10 | 11013200321141 |
11 | 3566743516627 |
12 | 129a522607585 |
13 | 61b704163275 |
14 | 2a10827684bb |
15 | 14172a4ca7cb |
hex | a0435e49a75 |
11013200321141 has 2 divisors, whose sum is σ = 11013200321142. Its totient is φ = 11013200321140.
The previous prime is 11013200321027. The next prime is 11013200321147. The reversal of 11013200321141 is 14112300231011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10999477370116 + 13722951025 = 3316546^2 + 117145^2 .
It is a cyclic number.
It is not a de Polignac number, because 11013200321141 - 230 = 11012126579317 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11013200321147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506600160570 + 5506600160571.
It is an arithmetic number, because the mean of its divisors is an integer number (5506600160571).
Almost surely, 211013200321141 is an apocalyptic number.
It is an amenable number.
11013200321141 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013200321141 is an equidigital number, since it uses as much as digits as its factorization.
11013200321141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 11013200321141 its reverse (14112300231011), we get a palindrome (25125500552152).
The spelling of 11013200321141 in words is "eleven trillion, thirteen billion, two hundred million, three hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •