Base | Representation |
---|---|
bin | 10000000000101010110… |
… | …101001000101100100101 |
3 | 10220011212221020010220102 |
4 | 100000222311020230211 |
5 | 121011232412400401 |
6 | 2201234435313445 |
7 | 142326505252604 |
oct | 20005265105445 |
9 | 3804787203812 |
10 | 1100230200101 |
11 | 3946722a080a |
12 | 159294a4b885 |
13 | 7c99c6a7656 |
14 | 3b373caba3b |
15 | 1d945cc356b |
hex | 1002ad48b25 |
1100230200101 has 8 divisors (see below), whose sum is σ = 1110970818840. Its totient is φ = 1089528853248.
The previous prime is 1100230200079. The next prime is 1100230200107. The reversal of 1100230200101 is 1010020320011.
It can be written as a sum of positive squares in 4 ways, for example, as 225539508100 + 874690692001 = 474910^2 + 935249^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1100230200101 - 26 = 1100230200037 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 (1100230200107) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9761666 + ... + 9873731.
It is an arithmetic number, because the mean of its divisors is an integer number (138871352355).
Almost surely, 21100230200101 is an apocalyptic number.
It is an amenable number.
1100230200101 is a deficient number, since it is larger than the sum of its proper divisors (10740618739).
1100230200101 is a wasteful number, since it uses less digits than its factorization.
1100230200101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19635943.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1100230200101 its reverse (1010020320011), we get a palindrome (2110250520112).
The spelling of 1100230200101 in words is "one trillion, one hundred billion, two hundred thirty million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •