Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …100011110010011101001 |
3 | 10220011120000011222212200 |
4 | 100000203030132103221 |
5 | 121011002114201301 |
6 | 2201214021530413 |
7 | 142323361364526 |
oct | 20004314362351 |
9 | 3804500158780 |
10 | 1100102100201 |
11 | 394606a57425 |
12 | 159259b73a09 |
13 | 7c97bca59b0 |
14 | 3b360c8414d |
15 | 1d93991cc86 |
hex | 1002331e4e9 |
1100102100201 has 12 divisors (see below), whose sum is σ = 1711269933828. Its totient is φ = 676985907744.
The previous prime is 1100102100197. The next prime is 1100102100221. The reversal of 1100102100201 is 1020012010011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 62026400601 + 1038075699600 = 249051^2 + 1018860^2 .
It is not a de Polignac number, because 1100102100201 - 22 = 1100102100197 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1100102100221) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4701290910 + ... + 4701291143.
It is an arithmetic number, because the mean of its divisors is an integer number (142605827819).
Almost surely, 21100102100201 is an apocalyptic number.
It is an amenable number.
1100102100201 is a deficient number, since it is larger than the sum of its proper divisors (611167833627).
1100102100201 is a wasteful number, since it uses less digits than its factorization.
1100102100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9402582072 (or 9402582069 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1100102100201 its reverse (1020012010011), we get a palindrome (2120114110212).
The spelling of 1100102100201 in words is "one trillion, one hundred billion, one hundred two million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •