Base | Representation |
---|---|
bin | 1010000000110111110110… |
… | …1100111001101010111000 |
3 | 1102222120000111121002021001 |
4 | 2200031331230321222320 |
5 | 2420342201141232300 |
6 | 35225550314054344 |
7 | 2214311535504046 |
oct | 240157554715270 |
9 | 42876014532231 |
10 | 11010110102200 |
11 | 35653a8135380 |
12 | 12999bb71a3b4 |
13 | 61b330b81251 |
14 | 2a0c6c199396 |
15 | 1415e906516a |
hex | a037db39ab8 |
11010110102200 has 96 divisors (see below), whose sum is σ = 27962343130320. Its totient is φ = 3998414720000.
The previous prime is 11010110102183. The next prime is 11010110102207. The reversal of 11010110102200 is 220101101011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11010110102207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1613971 + ... + 4962370.
Almost surely, 211010110102200 is an apocalyptic number.
11010110102200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11010110102200 is an abundant number, since it is smaller than the sum of its proper divisors (16952233028120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11010110102200 is a wasteful number, since it uses less digits than its factorization.
11010110102200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6577129 (or 6577120 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 11010110102200 its reverse (220101101011), we get a palindrome (11230211203211).
The spelling of 11010110102200 in words is "eleven trillion, ten billion, one hundred ten million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •