Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …000101010001001000101 |
3 | 10220011112221022011222221 |
4 | 100000203020222021011 |
5 | 121011001340200401 |
6 | 2201213544252341 |
7 | 142323350031013 |
oct | 20004310521105 |
9 | 3804487264887 |
10 | 1100101100101 |
11 | 394606433aa3 |
12 | 1592597710b1 |
13 | 7c97ba15713 |
14 | 3b360aa38b3 |
15 | 1d9397c17a1 |
hex | 1002322a245 |
1100101100101 has 4 divisors (see below), whose sum is σ = 1100358558412. Its totient is φ = 1099843641792.
The previous prime is 1100101100093. The next prime is 1100101100107. The reversal of 1100101100101 is 1010011010011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 490805330625 + 609295769476 = 700575^2 + 780574^2 .
It is a cyclic number.
It is not a de Polignac number, because 1100101100101 - 23 = 1100101100093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100101100107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 128722746 + ... + 128731291.
It is an arithmetic number, because the mean of its divisors is an integer number (275089639603).
Almost surely, 21100101100101 is an apocalyptic number.
It is an amenable number.
1100101100101 is a deficient number, since it is larger than the sum of its proper divisors (257458311).
1100101100101 is an equidigital number, since it uses as much as digits as its factorization.
1100101100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 257458310.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 1100101100101 its reverse (1010011010011), we get a palindrome (2110112110112).
The spelling of 1100101100101 in words is "one trillion, one hundred billion, one hundred one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •