Base | Representation |
---|---|
bin | 11110101110000010101… |
… | …011001011100111101000 |
3 | 21110210220201000020211111 |
4 | 132232002223023213220 |
5 | 234041332423101300 |
6 | 4253442332440104 |
7 | 305342034662101 |
oct | 36560253134750 |
9 | 7423821006744 |
10 | 2111021300200 |
11 | 74430854294a |
12 | 2a1168919034 |
13 | 1240b7518607 |
14 | 742615673a8 |
15 | 39da4ab29ba |
hex | 1eb82acb9e8 |
2111021300200 has 96 divisors (see below), whose sum is σ = 5017744915200. Its totient is φ = 825733117440.
The previous prime is 2111021300191. The next prime is 2111021300233. The reversal of 2111021300200 is 20031201112.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1260841 + ... + 2410759.
It is an arithmetic number, because the mean of its divisors is an integer number (52268176200).
Almost surely, 22111021300200 is an apocalyptic number.
2111021300200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2111021300200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2508872457600).
2111021300200 is an abundant number, since it is smaller than the sum of its proper divisors (2906723615000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111021300200 is a wasteful number, since it uses less digits than its factorization.
2111021300200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1150139 (or 1150130 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 2111021300200 its reverse (20031201112), we get a palindrome (2131052501312).
The spelling of 2111021300200 in words is "two trillion, one hundred eleven billion, twenty-one million, three hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •