Base | Representation |
---|---|
bin | 11110100011111000011… |
… | …011111001001100111000 |
3 | 21102202202102102120112010 |
4 | 132203320123321030320 |
5 | 233402012144232300 |
6 | 4244440030445520 |
7 | 304504510222110 |
oct | 36437033711470 |
9 | 7382672376463 |
10 | 2100112102200 |
11 | 73a71a593a32 |
12 | 29b0233638a0 |
13 | 123069363c78 |
14 | 73908772040 |
15 | 39966eaca50 |
hex | 1e8f86f9338 |
2100112102200 has 96 divisors (see below), whose sum is σ = 7440397176960. Its totient is φ = 480025622400.
The previous prime is 2100112102093. The next prime is 2100112102259. The reversal of 2100112102200 is 22012110012.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
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, 250009146 + ... + 250017545.
It is an arithmetic number, because the mean of its divisors is an integer number (77504137260).
Almost surely, 22100112102200 is an apocalyptic number.
2100112102200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2100112102200 is an abundant number, since it is smaller than the sum of its proper divisors (5340285074760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2100112102200 is a wasteful number, since it uses less digits than its factorization.
2100112102200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 500026717 (or 500026708 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2100112102200 its reverse (22012110012), we get a palindrome (2122124212212).
The spelling of 2100112102200 in words is "two trillion, one hundred billion, one hundred twelve million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •