Base | Representation |
---|---|
bin | 1010010010100001000000… |
… | …0011001100100111010101 |
3 | 1111001112101021102022120221 |
4 | 2210220100003030213111 |
5 | 2440323430030144341 |
6 | 40021115055554341 |
7 | 2245231652651311 |
oct | 244502003144725 |
9 | 44045337368527 |
10 | 11313213131221 |
11 | 36719a7972271 |
12 | 13286b022b9b1 |
13 | 640aa68287b1 |
14 | 2b17c3482b41 |
15 | 149438d69ed1 |
hex | a4a100cc9d5 |
11313213131221 has 2 divisors, whose sum is σ = 11313213131222. Its totient is φ = 11313213131220.
The previous prime is 11313213131191. The next prime is 11313213131237. The reversal of 11313213131221 is 12213131231311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10935124648900 + 378088482321 = 3306830^2 + 614889^2 .
It is a cyclic number.
It is not a de Polignac number, because 11313213131221 - 25 = 11313213131189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11313213131251) 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, 5656606565610 + 5656606565611.
It is an arithmetic number, because the mean of its divisors is an integer number (5656606565611).
Almost surely, 211313213131221 is an apocalyptic number.
It is an amenable number.
11313213131221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11313213131221 is an equidigital number, since it uses as much as digits as its factorization.
11313213131221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 648, while the sum is 25.
Adding to 11313213131221 its reverse (12213131231311), we get a palindrome (23526344362532).
The spelling of 11313213131221 in words is "eleven trillion, three hundred thirteen billion, two hundred thirteen million, one hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •