Base | Representation |
---|---|
bin | 1010000110110000100001… |
… | …1000011010001001000101 |
3 | 1110100020000002121102220121 |
4 | 2201230020120122021011 |
5 | 2424021240034323023 |
6 | 35344231403501541 |
7 | 2224521262161544 |
oct | 241541030321105 |
9 | 43306002542817 |
10 | 11111221011013 |
11 | 35a4273656732 |
12 | 12b55195278b1 |
13 | 627a25890a86 |
14 | 2a5b0099815b |
15 | 144065a8cd5d |
hex | a1b0861a245 |
11111221011013 has 2 divisors, whose sum is σ = 11111221011014. Its totient is φ = 11111221011012.
The previous prime is 11111221010993. The next prime is 11111221011041. The reversal of 11111221011013 is 31011012211111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6694674983649 + 4416546027364 = 2587407^2 + 2101558^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111221011013 - 237 = 10973782057541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111221011613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555610505506 + 5555610505507.
It is an arithmetic number, because the mean of its divisors is an integer number (5555610505507).
Almost surely, 211111221011013 is an apocalyptic number.
It is an amenable number.
11111221011013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111221011013 is an equidigital number, since it uses as much as digits as its factorization.
11111221011013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 11111221011013 its reverse (31011012211111), we get a palindrome (42122233222124).
The spelling of 11111221011013 in words is "eleven trillion, one hundred eleven billion, two hundred twenty-one million, eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •