Base | Representation |
---|---|
bin | 10000000001011000101… |
… | …101110001010001001111 |
3 | 10220020212120210002202012 |
4 | 100001120231301101033 |
5 | 121014322001133241 |
6 | 2201443055251435 |
7 | 142354543523606 |
oct | 20013055612117 |
9 | 3806776702665 |
10 | 1101000021071 |
11 | 394a27899695 |
12 | 15946a819b7b |
13 | 7ca93021c12 |
14 | 3b40821ca3d |
15 | 1d98d6886eb |
hex | 10058b7144f |
1101000021071 has 2 divisors, whose sum is σ = 1101000021072. Its totient is φ = 1101000021070.
The previous prime is 1101000021001. The next prime is 1101000021073. The reversal of 1101000021071 is 1701200001011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1101000021071 - 222 = 1100995826767 is a prime.
Together with 1101000021073, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1101000021073) 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, 550500010535 + 550500010536.
It is an arithmetic number, because the mean of its divisors is an integer number (550500010536).
Almost surely, 21101000021071 is an apocalyptic number.
1101000021071 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101000021071 is an equidigital number, since it uses as much as digits as its factorization.
1101000021071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 14.
Adding to 1101000021071 its reverse (1701200001011), we get a palindrome (2802200022082).
The spelling of 1101000021071 in words is "one trillion, one hundred one billion, twenty-one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •