Base | Representation |
---|---|
bin | 101101101110011000111110… |
… | …110001111110010111011011 |
3 | 222101000222021121022120022012 |
4 | 231232120332301332113123 |
5 | 202324310311034134321 |
6 | 1551412023052420135 |
7 | 60233665524240362 |
oct | 5556307661762733 |
9 | 871028247276265 |
10 | 201100012021211 |
11 | 59093044135026 |
12 | 1a67a64317764b |
13 | 882985a6b59a4 |
14 | 379341493a7d9 |
15 | 183b115b1705b |
hex | b6e63ec7e5db |
201100012021211 has 4 divisors (see below), whose sum is σ = 201978178012800. Its totient is φ = 200221846029624.
The previous prime is 201100012021201. The next prime is 201100012021283. The reversal of 201100012021211 is 112120210001102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201100012021211 - 230 = 201098938279387 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201100012021201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 439082995451 + ... + 439082995908.
It is an arithmetic number, because the mean of its divisors is an integer number (50494544503200).
Almost surely, 2201100012021211 is an apocalyptic number.
201100012021211 is a deficient number, since it is larger than the sum of its proper divisors (878165991589).
201100012021211 is an equidigital number, since it uses as much as digits as its factorization.
201100012021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 878165991588.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 201100012021211 its reverse (112120210001102), we get a palindrome (313220222022313).
The spelling of 201100012021211 in words is "two hundred one trillion, one hundred billion, twelve million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •