Base | Representation |
---|---|
bin | 1010000001100000110101… |
… | …0110100100000011100101 |
3 | 1110000121102010000212202021 |
4 | 2200120031112210003211 |
5 | 2421032213141201242 |
6 | 35235010022143141 |
7 | 2215151245111051 |
oct | 240301526440345 |
9 | 43017363025667 |
10 | 11021110100197 |
11 | 356a03237170a |
12 | 129bb6b581ab1 |
13 | 61c394aa79c2 |
14 | 2a15d3068c61 |
15 | 141a3eb03b67 |
hex | a060d5a40e5 |
11021110100197 has 2 divisors, whose sum is σ = 11021110100198. Its totient is φ = 11021110100196.
The previous prime is 11021110100183. The next prime is 11021110100249. The reversal of 11021110100197 is 79100101112011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5701011007041 + 5320099093156 = 2387679^2 + 2306534^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11021110100197 is a prime.
It is a super-3 number, since 3×110211101001973 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11021110100177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510555050098 + 5510555050099.
It is an arithmetic number, because the mean of its divisors is an integer number (5510555050099).
Almost surely, 211021110100197 is an apocalyptic number.
It is an amenable number.
11021110100197 is a deficient number, since it is larger than the sum of its proper divisors (1).
11021110100197 is an equidigital number, since it uses as much as digits as its factorization.
11021110100197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 126, while the sum is 25.
The spelling of 11021110100197 in words is "eleven trillion, twenty-one billion, one hundred ten million, one hundred thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •