Base | Representation |
---|---|
bin | 101111111110101111110010… |
… | …101100100111000001001001 |
3 | 1000200011022210021210121001002 |
4 | 233332233302230213001021 |
5 | 210124323141130001301 |
6 | 2024445144504104345 |
7 | 62306462020630265 |
oct | 5776576254470111 |
9 | 1020138707717032 |
10 | 211020110000201 |
11 | 612681428a3037 |
12 | 1b80113ba650b5 |
13 | 9099159ac3028 |
14 | 3a175dbd170a5 |
15 | 195e1b5e9216b |
hex | bfebf2b27049 |
211020110000201 has 4 divisors (see below), whose sum is σ = 211020177846912. Its totient is φ = 211020042153492.
The previous prime is 211020110000191. The next prime is 211020110000213. The reversal of 211020110000201 is 102000011020112.
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 a de Polignac number, because none of the positive numbers 2k-211020110000201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211020110000501) 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, 29021921 + ... + 35557166.
It is an arithmetic number, because the mean of its divisors is an integer number (52755044461728).
Almost surely, 2211020110000201 is an apocalyptic number.
It is an amenable number.
211020110000201 is a deficient number, since it is larger than the sum of its proper divisors (67846711).
211020110000201 is an equidigital number, since it uses as much as digits as its factorization.
211020110000201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67846710.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 211020110000201 its reverse (102000011020112), we get a palindrome (313020121020313).
The spelling of 211020110000201 in words is "two hundred eleven trillion, twenty billion, one hundred ten million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •