Base | Representation |
---|---|
bin | 1010010010100001010111… |
… | …0101100011111011110101 |
3 | 1111001112122001002221101102 |
4 | 2210220111311203323311 |
5 | 2440324124404020041 |
6 | 40021132444535445 |
7 | 2245234242130115 |
oct | 244502565437365 |
9 | 44045561087342 |
10 | 11313310220021 |
11 | 3671a47755547 |
12 | 1328718851585 |
13 | 640ac09901a4 |
14 | 2b17d2317045 |
15 | 14944264709b |
hex | a4a15d63ef5 |
11313310220021 has 2 divisors, whose sum is σ = 11313310220022. Its totient is φ = 11313310220020.
The previous prime is 11313310220011. The next prime is 11313310220053. The reversal of 11313310220021 is 12002201331311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10402785862225 + 910524357796 = 3225335^2 + 954214^2 .
It is a cyclic number.
It is not a de Polignac number, because 11313310220021 - 26 = 11313310219957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11313310219975 and 11313310220002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11313310220011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5656655110010 + 5656655110011.
It is an arithmetic number, because the mean of its divisors is an integer number (5656655110011).
Almost surely, 211313310220021 is an apocalyptic number.
It is an amenable number.
11313310220021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11313310220021 is an equidigital number, since it uses as much as digits as its factorization.
11313310220021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11313310220021 its reverse (12002201331311), we get a palindrome (23315511551332).
The spelling of 11313310220021 in words is "eleven trillion, three hundred thirteen billion, three hundred ten million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •