Base | Representation |
---|---|
bin | 1010000000010101111101… |
… | …1010110001110001111111 |
3 | 1102221200112110002200210212 |
4 | 2200011133122301301333 |
5 | 2420220033044201343 |
6 | 35221443432223035 |
7 | 2213540222661665 |
oct | 240053732616177 |
9 | 42850473080725 |
10 | 11001012100223 |
11 | 3561559597882 |
12 | 12980a083aa7b |
13 | 61a511009a22 |
14 | 2a0647b52c35 |
15 | 14126547ac18 |
hex | a015f6b1c7f |
11001012100223 has 2 divisors, whose sum is σ = 11001012100224. Its totient is φ = 11001012100222.
The previous prime is 11001012100087. The next prime is 11001012100271. The reversal of 11001012100223 is 32200121010011.
It is a strong prime.
It is an emirp because it is prime and its reverse (32200121010011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11001012100223 - 212 = 11001012096127 is a prime.
It is a super-2 number, since 2×110010121002232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11001012100198 and 11001012100207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001012106223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500506050111 + 5500506050112.
It is an arithmetic number, because the mean of its divisors is an integer number (5500506050112).
Almost surely, 211001012100223 is an apocalyptic number.
11001012100223 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001012100223 is an equidigital number, since it uses as much as digits as its factorization.
11001012100223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11001012100223 its reverse (32200121010011), we get a palindrome (43201133110234).
The spelling of 11001012100223 in words is "eleven trillion, one billion, twelve million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •