Base | Representation |
---|---|
bin | 11101001000101100100… |
… | …01101000010001001011 |
3 | 10112201000110100002212111 |
4 | 32210112101220101023 |
5 | 112400223340200412 |
6 | 2043522142523151 |
7 | 132220134643303 |
oct | 16442621502113 |
9 | 3481013302774 |
10 | 1001101100107 |
11 | 356623521789 |
12 | 14202a8964b7 |
13 | 73532443174 |
14 | 3664c790603 |
15 | 1b0932682a7 |
hex | e91646844b |
1001101100107 has 2 divisors, whose sum is σ = 1001101100108. Its totient is φ = 1001101100106.
The previous prime is 1001101100057. The next prime is 1001101100117. The reversal of 1001101100107 is 7010011011001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1001101100107 - 227 = 1000966882379 is a prime.
It is a super-2 number, since 2×10011011001072 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1001101100117) 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, 500550550053 + 500550550054.
It is an arithmetic number, because the mean of its divisors is an integer number (500550550054).
Almost surely, 21001101100107 is an apocalyptic number.
1001101100107 is a deficient number, since it is larger than the sum of its proper divisors (1).
1001101100107 is an equidigital number, since it uses as much as digits as its factorization.
1001101100107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7, while the sum is 13.
Adding to 1001101100107 its reverse (7010011011001), we get a palindrome (8011112111108).
The spelling of 1001101100107 in words is "one trillion, one billion, one hundred one million, one hundred thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •