Base | Representation |
---|---|
bin | 1010010010100000111111… |
… | …1011001001011111010111 |
3 | 1111001112101010110010021122 |
4 | 2210220033323021133113 |
5 | 2440323424010140041 |
6 | 40021114542434155 |
7 | 2245231626012665 |
oct | 244501773113727 |
9 | 44045333403248 |
10 | 11313211021271 |
11 | 36719a6761005 |
12 | 13286ab59295b |
13 | 640aa626a2c3 |
14 | 2b17c3093c35 |
15 | 149438a9ec4b |
hex | a4a0fec97d7 |
11313211021271 has 2 divisors, whose sum is σ = 11313211021272. Its totient is φ = 11313211021270.
The previous prime is 11313211021253. The next prime is 11313211021363. The reversal of 11313211021271 is 17212011231311.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11313211021271 - 222 = 11313206826967 is a prime.
It is a super-2 number, since 2×113132110212712 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11313211021271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11313211027271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5656605510635 + 5656605510636.
It is an arithmetic number, because the mean of its divisors is an integer number (5656605510636).
Almost surely, 211313211021271 is an apocalyptic number.
11313211021271 is a deficient number, since it is larger than the sum of its proper divisors (1).
11313211021271 is an equidigital number, since it uses as much as digits as its factorization.
11313211021271 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 26.
Adding to 11313211021271 its reverse (17212011231311), we get a palindrome (28525222252582).
The spelling of 11313211021271 in words is "eleven trillion, three hundred thirteen billion, two hundred eleven million, twenty-one thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •