Base | Representation |
---|---|
bin | 110000000000000101011000… |
… | …011110111111100100110100 |
3 | 1000200111010000002122220211220 |
4 | 300000011120132333210310 |
5 | 210132324400034120040 |
6 | 2024555304111230340 |
7 | 62316224314125156 |
oct | 6000053036774464 |
9 | 1020433002586756 |
10 | 211112012020020 |
11 | 612a3113119831 |
12 | 1b816b098183b0 |
13 | 90a4a149a5307 |
14 | 3a1bc39686ad6 |
15 | 19617942ca2d0 |
hex | c001587bf934 |
211112012020020 has 24 divisors (see below), whose sum is σ = 591113633656224. Its totient is φ = 56296536538656.
The previous prime is 211112012019967. The next prime is 211112012020037. The reversal of 211112012020020 is 20020210211112.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1759266766774 + ... + 1759266766893.
It is an arithmetic number, because the mean of its divisors is an integer number (24629734735676).
Almost surely, 2211112012020020 is an apocalyptic number.
211112012020020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211112012020020 is an abundant number, since it is smaller than the sum of its proper divisors (380001621636204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211112012020020 is a wasteful number, since it uses less digits than its factorization.
211112012020020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3518533533679 (or 3518533533677 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211112012020020 its reverse (20020210211112), we get a palindrome (231132222231132).
The spelling of 211112012020020 in words is "two hundred eleven trillion, one hundred twelve billion, twelve million, twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •