Base | Representation |
---|---|
bin | 101111111110101111101101… |
… | …011001100011110000010101 |
3 | 1000200011022120002120000100120 |
4 | 233332233231121203300111 |
5 | 210124323000401320041 |
6 | 2024445132011102153 |
7 | 62306456561310351 |
oct | 5776575531436025 |
9 | 1020138502500316 |
10 | 211020021120021 |
11 | 612680a7707043 |
12 | 1b801116141959 |
13 | 90991445739c9 |
14 | 3a175d01bc461 |
15 | 195e1ad287366 |
hex | bfebed663c15 |
211020021120021 has 4 divisors (see below), whose sum is σ = 281360028160032. Its totient is φ = 140680014080012.
The previous prime is 211020021120017. The next prime is 211020021120067. The reversal of 211020021120021 is 120021120020112.
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 a cyclic number.
It is not a de Polignac number, because 211020021120021 - 22 = 211020021120017 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211020021320021) 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, 35170003520001 + ... + 35170003520006.
It is an arithmetic number, because the mean of its divisors is an integer number (70340007040008).
Almost surely, 2211020021120021 is an apocalyptic number.
It is an amenable number.
211020021120021 is a deficient number, since it is larger than the sum of its proper divisors (70340007040011).
211020021120021 is an equidigital number, since it uses as much as digits as its factorization.
211020021120021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70340007040010.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 211020021120021 its reverse (120021120020112), we get a palindrome (331041141140133).
The spelling of 211020021120021 in words is "two hundred eleven trillion, twenty billion, twenty-one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •