Base | Representation |
---|---|
bin | 11101011011010100100… |
… | …01001010110000100011 |
3 | 10120122211022102000020111 |
4 | 32231222101022300203 |
5 | 113031213122344341 |
6 | 2052254254152151 |
7 | 133023001616041 |
oct | 16555221126043 |
9 | 3518738360214 |
10 | 1011100199971 |
11 | 35a894781484 |
12 | 143b5b4b2657 |
13 | 74466ba69c4 |
14 | 36d1a75b391 |
15 | 1b47aee9681 |
hex | eb6a44ac23 |
1011100199971 has 2 divisors, whose sum is σ = 1011100199972. Its totient is φ = 1011100199970.
The previous prime is 1011100199861. The next prime is 1011100200017. The reversal of 1011100199971 is 1799910011101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1011100199971 - 211 = 1011100197923 is a prime.
It is a super-2 number, since 2×10111001999712 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1011100499971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505550099985 + 505550099986.
It is an arithmetic number, because the mean of its divisors is an integer number (505550099986).
Almost surely, 21011100199971 is an apocalyptic number.
1011100199971 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011100199971 is an equidigital number, since it uses as much as digits as its factorization.
1011100199971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5103, while the sum is 40.
The spelling of 1011100199971 in words is "one trillion, eleven billion, one hundred million, one hundred ninety-nine thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •