Base | Representation |
---|---|
bin | 1010000001000011110010… |
… | …1000001101110000100101 |
3 | 1102222212021202000111210012 |
4 | 2200100330220031300211 |
5 | 2420420231202301041 |
6 | 35231240222140005 |
7 | 2214454112434253 |
oct | 240207450156045 |
9 | 42885252014705 |
10 | 11013313322021 |
11 | 35667a128788a |
12 | 129a554421605 |
13 | 61b7216a94aa |
14 | 2a10937815d3 |
15 | 14173539c3eb |
hex | a043ca0dc25 |
11013313322021 has 2 divisors, whose sum is σ = 11013313322022. Its totient is φ = 11013313322020.
The previous prime is 11013313322009. The next prime is 11013313322083. The reversal of 11013313322021 is 12022331331011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9527803317796 + 1485510004225 = 3086714^2 + 1218815^2 .
It is a cyclic number.
It is not a de Polignac number, because 11013313322021 - 26 = 11013313321957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11013313312021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506656661010 + 5506656661011.
It is an arithmetic number, because the mean of its divisors is an integer number (5506656661011).
Almost surely, 211013313322021 is an apocalyptic number.
It is an amenable number.
11013313322021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013313322021 is an equidigital number, since it uses as much as digits as its factorization.
11013313322021 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 23.
Adding to 11013313322021 its reverse (12022331331011), we get a palindrome (23035644653032).
The spelling of 11013313322021 in words is "eleven trillion, thirteen billion, three hundred thirteen million, three hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •