Base | Representation |
---|---|
bin | 1010000001000011110110… |
… | …1111110111000011001101 |
3 | 1102222212100001100200221211 |
4 | 2200100331233313003031 |
5 | 2420420301004301443 |
6 | 35231242132454421 |
7 | 2214454431166345 |
oct | 240207557670315 |
9 | 42885301320854 |
10 | 11013332103373 |
11 | 3566800945566 |
12 | 129a55a77a411 |
13 | 61b725554012 |
14 | 2a109606dd25 |
15 | 141736d5c19d |
hex | a043dbf70cd |
11013332103373 has 2 divisors, whose sum is σ = 11013332103374. Its totient is φ = 11013332103372.
The previous prime is 11013332103289. The next prime is 11013332103377. The reversal of 11013332103373 is 37330123331011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10968370293609 + 44961809764 = 3311853^2 + 212042^2 .
It is a cyclic number.
It is not a de Polignac number, because 11013332103373 - 221 = 11013330006221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11013332103377) 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, 5506666051686 + 5506666051687.
It is an arithmetic number, because the mean of its divisors is an integer number (5506666051687).
Almost surely, 211013332103373 is an apocalyptic number.
It is an amenable number.
11013332103373 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013332103373 is an equidigital number, since it uses as much as digits as its factorization.
11013332103373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 31.
Adding to 11013332103373 its reverse (37330123331011), we get a palindrome (48343455434384).
The spelling of 11013332103373 in words is "eleven trillion, thirteen billion, three hundred thirty-two million, one hundred three thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •