Base | Representation |
---|---|
bin | 10000000001011001010… |
… | …100010000011000010011 |
3 | 10220020220021202200010011 |
4 | 100001121110100120103 |
5 | 121014332042004341 |
6 | 2201444055415351 |
7 | 142355025343402 |
oct | 20013124203023 |
9 | 3806807680104 |
10 | 1101010109971 |
11 | 394a3255a622 |
12 | 159472084557 |
13 | 7ca95145095 |
14 | 3b4096c7639 |
15 | 1d98e4ccb81 |
hex | 10059510613 |
1101010109971 has 2 divisors, whose sum is σ = 1101010109972. Its totient is φ = 1101010109970.
The previous prime is 1101010109959. The next prime is 1101010110017. The reversal of 1101010109971 is 1799010101011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1101010109971 - 217 = 1101009978899 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101010107971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550505054985 + 550505054986.
It is an arithmetic number, because the mean of its divisors is an integer number (550505054986).
Almost surely, 21101010109971 is an apocalyptic number.
1101010109971 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101010109971 is an equidigital number, since it uses as much as digits as its factorization.
1101010109971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 567, while the sum is 31.
The spelling of 1101010109971 in words is "one trillion, one hundred one billion, ten million, one hundred nine thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •