Base | Representation |
---|---|
bin | 110000001110100111111101… |
… | …011100100000000100100001 |
3 | 1000211000122010001202010121121 |
4 | 300032213331130200010201 |
5 | 210300212230234120001 |
6 | 2031042313503052241 |
7 | 62451346366030510 |
oct | 6016477534400441 |
9 | 1024018101663547 |
10 | 212111212020001 |
11 | 61648950503888 |
12 | 1b9586a78a1081 |
13 | 91480032bac58 |
14 | 3a54347764677 |
15 | 197c7756b96a1 |
hex | c0e9fd720121 |
212111212020001 has 4 divisors (see below), whose sum is σ = 242412813737152. Its totient is φ = 181809610302852.
The previous prime is 212111212019953. The next prime is 212111212020013. The reversal of 212111212020001 is 100020212111212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 212111212020001 - 235 = 212076852281633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212111212020031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15150800858565 + ... + 15150800858578.
It is an arithmetic number, because the mean of its divisors is an integer number (60603203434288).
Almost surely, 2212111212020001 is an apocalyptic number.
It is an amenable number.
212111212020001 is a deficient number, since it is larger than the sum of its proper divisors (30301601717151).
212111212020001 is an equidigital number, since it uses as much as digits as its factorization.
212111212020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30301601717150.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 212111212020001 its reverse (100020212111212), we get a palindrome (312131424131213).
The spelling of 212111212020001 in words is "two hundred twelve trillion, one hundred eleven billion, two hundred twelve million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •