Base | Representation |
---|---|
bin | 1010001101010000111110… |
… | …0010000011110101111011 |
3 | 1110201220112212120010221212 |
4 | 2203110033202003311323 |
5 | 2432334211043200243 |
6 | 35511440224353335 |
7 | 2235556440054314 |
oct | 243241742036573 |
9 | 43656485503855 |
10 | 11223010131323 |
11 | 36377196aa371 |
12 | 131311747584b |
13 | 63542c93b943 |
14 | 2ab2a762160b |
15 | 146e09c90318 |
hex | a350f883d7b |
11223010131323 has 2 divisors, whose sum is σ = 11223010131324. Its totient is φ = 11223010131322.
The previous prime is 11223010131301. The next prime is 11223010131337. The reversal of 11223010131323 is 32313101032211.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11223010131323 is a prime.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11223010131923) 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, 5611505065661 + 5611505065662.
It is an arithmetic number, because the mean of its divisors is an integer number (5611505065662).
Almost surely, 211223010131323 is an apocalyptic number.
11223010131323 is a deficient number, since it is larger than the sum of its proper divisors (1).
11223010131323 is an equidigital number, since it uses as much as digits as its factorization.
11223010131323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 11223010131323 its reverse (32313101032211), we get a palindrome (43536111163534).
The spelling of 11223010131323 in words is "eleven trillion, two hundred twenty-three billion, ten million, one hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •