Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …010000000110001101101 |
3 | 10220011210211102220002200 |
4 | 100000221002000301231 |
5 | 121011202201133401 |
6 | 2201231440412113 |
7 | 142325660610306 |
oct | 20005102006155 |
9 | 3804724386080 |
10 | 1100200021101 |
11 | 394657258895 |
12 | 159286917039 |
13 | 7c99636c05c |
14 | 3b36dc937ad |
15 | 1d943311686 |
hex | 10029080c6d |
1100200021101 has 12 divisors (see below), whose sum is σ = 1589366454780. Its totient is φ = 733379613120.
The previous prime is 1100200021099. The next prime is 1100200021133. The reversal of 1100200021101 is 1011200020011.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 522546819876 + 577653201225 = 722874^2 + 760035^2 .
It is not a de Polignac number, because 1100200021101 - 21 = 1100200021099 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100200021171) 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, 7175560 + ... + 7327281.
It is an arithmetic number, because the mean of its divisors is an integer number (132447204565).
Almost surely, 21100200021101 is an apocalyptic number.
It is an amenable number.
1100200021101 is a deficient number, since it is larger than the sum of its proper divisors (489166433679).
1100200021101 is a wasteful number, since it uses less digits than its factorization.
1100200021101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14511276 (or 14511273 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1100200021101 its reverse (1011200020011), we get a palindrome (2111400041112).
The spelling of 1100200021101 in words is "one trillion, one hundred billion, two hundred million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •