Base | Representation |
---|---|
bin | 1010010010011001001111… |
… | …1101010101110000011111 |
3 | 1111001100000011221022200211 |
4 | 2210212103331111300133 |
5 | 2440310144043033043 |
6 | 40020132325233251 |
7 | 2245126243006264 |
oct | 244462375256037 |
9 | 44040004838624 |
10 | 11311131221023 |
11 | 367102976a327 |
12 | 132820ab62827 |
13 | 64083440277a |
14 | 2b1666b8526b |
15 | 1493661c7a9d |
hex | a4993f55c1f |
11311131221023 has 2 divisors, whose sum is σ = 11311131221024. Its totient is φ = 11311131221022.
The previous prime is 11311131221021. The next prime is 11311131221107. The reversal of 11311131221023 is 32012213111311.
It is a weak prime.
It is an emirp because it is prime and its reverse (32012213111311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11311131221023 - 21 = 11311131221021 is a prime.
Together with 11311131221021, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 11311131220985 and 11311131221003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11311131221021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5655565610511 + 5655565610512.
It is an arithmetic number, because the mean of its divisors is an integer number (5655565610512).
Almost surely, 211311131221023 is an apocalyptic number.
11311131221023 is a deficient number, since it is larger than the sum of its proper divisors (1).
11311131221023 is an equidigital number, since it uses as much as digits as its factorization.
11311131221023 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 22.
Adding to 11311131221023 its reverse (32012213111311), we get a palindrome (43323344332334).
The spelling of 11311131221023 in words is "eleven trillion, three hundred eleven billion, one hundred thirty-one million, two hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •