Base | Representation |
---|---|
bin | 1010000110001010110100… |
… | …1000001111010010010001 |
3 | 1110022020212202100110010201 |
4 | 2201202231020033102101 |
5 | 2423340023112022433 |
6 | 35335435221455201 |
7 | 2224012416016444 |
oct | 241425510172221 |
9 | 43266782313121 |
10 | 11101100110993 |
11 | 359aa4a675752 |
12 | 12b3573b71501 |
13 | 626aa1b22b39 |
14 | 2a542076365b |
15 | 143b7229ca7d |
hex | a18ad20f491 |
11101100110993 has 2 divisors, whose sum is σ = 11101100110994. Its totient is φ = 11101100110992.
The previous prime is 11101100110963. The next prime is 11101100111021. The reversal of 11101100110993 is 39901100110111.
It is an a-pointer prime, because the next prime (11101100111021) can be obtained adding 11101100110993 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10742025915009 + 359074195984 = 3277503^2 + 599228^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11101100110993 is a prime.
It is a super-4 number, since 4×111011001109934 (a number of 53 digits) contains 4444 as substring.
It is not a weakly prime, because it can be changed into another prime (11101100110913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550550055496 + 5550550055497.
It is an arithmetic number, because the mean of its divisors is an integer number (5550550055497).
Almost surely, 211101100110993 is an apocalyptic number.
It is an amenable number.
11101100110993 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101100110993 is an equidigital number, since it uses as much as digits as its factorization.
11101100110993 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243, while the sum is 28.
The spelling of 11101100110993 in words is "eleven trillion, one hundred one billion, one hundred million, one hundred ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •