Base | Representation |
---|---|
bin | 1010010010100001101111… |
… | …1010101000001100111001 |
3 | 1111001112220011000122102002 |
4 | 2210220123322220030321 |
5 | 2440324332011232023 |
6 | 40021150530550345 |
7 | 2245236621055316 |
oct | 244503372501471 |
9 | 44045804018362 |
10 | 11313412211513 |
11 | 3671a9a287235 |
12 | 1328746a383b5 |
13 | 640b08b50299 |
14 | 2b1801aa5d0d |
15 | 14944b591b28 |
hex | a4a1bea8339 |
11313412211513 has 2 divisors, whose sum is σ = 11313412211514. Its totient is φ = 11313412211512.
The previous prime is 11313412211477. The next prime is 11313412211567. The reversal of 11313412211513 is 31511221431311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11030980549264 + 282431662249 = 3321292^2 + 531443^2 .
It is a cyclic number.
It is not a de Polignac number, because 11313412211513 - 216 = 11313412145977 is a prime.
It is a super-2 number, since 2×113134122115132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11313412219513) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5656706105756 + 5656706105757.
It is an arithmetic number, because the mean of its divisors is an integer number (5656706105757).
Almost surely, 211313412211513 is an apocalyptic number.
It is an amenable number.
11313412211513 is a deficient number, since it is larger than the sum of its proper divisors (1).
11313412211513 is an equidigital number, since it uses as much as digits as its factorization.
11313412211513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2160, while the sum is 29.
Adding to 11313412211513 its reverse (31511221431311), we get a palindrome (42824633642824).
The spelling of 11313412211513 in words is "eleven trillion, three hundred thirteen billion, four hundred twelve million, two hundred eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •