Base | Representation |
---|---|
bin | 110000000001100010100000… |
… | …010110100100111100000000 |
3 | 1000200211200002120111021011222 |
4 | 300001202200112210330000 |
5 | 210140444140004133440 |
6 | 2025113242040054212 |
7 | 62326364210120312 |
oct | 6001424026447400 |
9 | 1020750076437158 |
10 | 211212002021120 |
11 | 61331563945581 |
12 | 1b832374164368 |
13 | 90b128b3c3839 |
14 | 3a22a032637b2 |
15 | 19641976dc2b5 |
hex | c018a05a4f00 |
211212002021120 has 72 divisors (see below), whose sum is σ = 507419992204944. Its totient is φ = 84234103898112.
The previous prime is 211212002021113. The next prime is 211212002021129. The reversal of 211212002021120 is 21120200212112.
It is a super-2 number, since 2×2112120020211202 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211212002021129) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 244389674 + ... + 245252393.
Almost surely, 2211212002021120 is an apocalyptic number.
211212002021120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211212002021120 is an abundant number, since it is smaller than the sum of its proper divisors (296207990183824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211212002021120 is an equidigital number, since it uses as much as digits as its factorization.
211212002021120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 489642425 (or 489642411 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 211212002021120 its reverse (21120200212112), we get a palindrome (232332202233232).
The spelling of 211212002021120 in words is "two hundred eleven trillion, two hundred twelve billion, two million, twenty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •