Base | Representation |
---|---|
bin | 1010010011100100011101… |
… | …0111010100101011100011 |
3 | 1111010021010020121112120221 |
4 | 2210321013113110223203 |
5 | 2441123021140220303 |
6 | 40033311554543511 |
7 | 2246442461335306 |
oct | 244710727245343 |
9 | 44107106545527 |
10 | 11331321023203 |
11 | 367964a346555 |
12 | 1330104597b97 |
13 | 642701203a8c |
14 | 2b2620356b3d |
15 | 149b489364bd |
hex | a4e475d4ae3 |
11331321023203 has 2 divisors, whose sum is σ = 11331321023204. Its totient is φ = 11331321023202.
The previous prime is 11331321023201. The next prime is 11331321023339. The reversal of 11331321023203 is 30232012313311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11331321023203 - 21 = 11331321023201 is a prime.
It is a super-2 number, since 2×113313210232032 (a number of 27 digits) contains 22 as substring.
Together with 11331321023201, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11331321023201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5665660511601 + 5665660511602.
It is an arithmetic number, because the mean of its divisors is an integer number (5665660511602).
Almost surely, 211331321023203 is an apocalyptic number.
11331321023203 is a deficient number, since it is larger than the sum of its proper divisors (1).
11331321023203 is an equidigital number, since it uses as much as digits as its factorization.
11331321023203 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 11331321023203 its reverse (30232012313311), we get a palindrome (41563333336514).
The spelling of 11331321023203 in words is "eleven trillion, three hundred thirty-one billion, three hundred twenty-one million, twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •