Base | Representation |
---|---|
bin | 1010000000010110010011… |
… | …0010000110011000100010 |
3 | 1102221200202201110011022000 |
4 | 2200011210302012120202 |
5 | 2420220224114200002 |
6 | 35221500405224430 |
7 | 2213542364654010 |
oct | 240054462063042 |
9 | 42850681404260 |
10 | 11001102100002 |
11 | 35615a5378a63 |
12 | 1298106a02116 |
13 | 61a52685b831 |
14 | 2a0655a9d8b0 |
15 | 14126d30761c |
hex | a0164c86622 |
11001102100002 has 32 divisors (see below), whose sum is σ = 27939306921600. Its totient is φ = 3143172028464.
The previous prime is 11001102099973. The next prime is 11001102100007. The reversal of 11001102100002 is 20000120110011.
It is a happy number.
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 (11001102100007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14551721977 + ... + 14551722732.
It is an arithmetic number, because the mean of its divisors is an integer number (873103341300).
Almost surely, 211001102100002 is an apocalyptic number.
11001102100002 is an abundant number, since it is smaller than the sum of its proper divisors (16938204821598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001102100002 is a wasteful number, since it uses less digits than its factorization.
11001102100002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29103444727 (or 29103444721 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11001102100002 its reverse (20000120110011), we get a palindrome (31001222210013).
The spelling of 11001102100002 in words is "eleven trillion, one billion, one hundred two million, one hundred thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •