Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …100101011101110100111 |
3 | 10220020220021222100210001 |
4 | 100001121110223232213 |
5 | 121014332104100431 |
6 | 2201444102042131 |
7 | 142355026321111 |
oct | 20013124535647 |
9 | 3806807870701 |
10 | 1101010221991 |
11 | 394a326267a9 |
12 | 159472119347 |
13 | 7ca95184074 |
14 | 3b4097163b1 |
15 | 1d98e500e61 |
hex | 1005952bba7 |
1101010221991 has 2 divisors, whose sum is σ = 1101010221992. Its totient is φ = 1101010221990.
The previous prime is 1101010221889. The next prime is 1101010222061. The reversal of 1101010221991 is 1991220101011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101010221991 - 237 = 963571268519 is a prime.
It is a super-2 number, since 2×11010102219912 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101010221791) 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, 550505110995 + 550505110996.
It is an arithmetic number, because the mean of its divisors is an integer number (550505110996).
Almost surely, 21101010221991 is an apocalyptic number.
1101010221991 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101010221991 is an equidigital number, since it uses as much as digits as its factorization.
1101010221991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 28.
The spelling of 1101010221991 in words is "one trillion, one hundred one billion, ten million, two hundred twenty-one thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •