Base | Representation |
---|---|
bin | 11110100110101011010… |
… | …100100100000010111000 |
3 | 21110001111120201022221200 |
4 | 132212223110210002320 |
5 | 233424134001132300 |
6 | 4250053520534200 |
7 | 304642052053251 |
oct | 36465324440270 |
9 | 7401446638850 |
10 | 2103113302200 |
11 | 740a1a6a3a09 |
12 | 29b720481360 |
13 | 123427078761 |
14 | 73b111abb28 |
15 | 39a906dc200 |
hex | 1e9ab5240b8 |
2103113302200 has 144 divisors (see below), whose sum is σ = 7434690127800. Its totient is φ = 531312825600.
The previous prime is 2103113302187. The next prime is 2103113302223. The reversal of 2103113302200 is 22033113012.
2103113302200 is a `hidden beast` number, since 2 + 1 + 0 + 311 + 330 + 2 + 20 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 30713071 + ... + 30781470.
Almost surely, 22103113302200 is an apocalyptic number.
2103113302200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2103113302200 is an abundant number, since it is smaller than the sum of its proper divisors (5331576825600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2103113302200 is a wasteful number, since it uses less digits than its factorization.
2103113302200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61494582 (or 61494570 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2103113302200 its reverse (22033113012), we get a palindrome (2125146415212).
The spelling of 2103113302200 in words is "two trillion, one hundred three billion, one hundred thirteen million, three hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •