Base | Representation |
---|---|
bin | 101101101100111100111110… |
… | …011100011010101011100011 |
3 | 222100200112021202200201120001 |
4 | 231230330332130122223203 |
5 | 202321201000330402321 |
6 | 1551254404154200431 |
7 | 60223600443040210 |
oct | 5554747634325343 |
9 | 870615252621501 |
10 | 201001222122211 |
11 | 590551598847a5 |
12 | 1a663472723117 |
13 | 88204457c6254 |
14 | 378c7224b8b07 |
15 | 1838782c60c91 |
hex | b6cf3e71aae3 |
201001222122211 has 4 divisors (see below), whose sum is σ = 229715682425392. Its totient is φ = 172286761819032.
The previous prime is 201001222122203. The next prime is 201001222122223. The reversal of 201001222122211 is 112221222100102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 201001222122211 - 23 = 201001222122203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201001222122251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14357230151580 + ... + 14357230151593.
It is an arithmetic number, because the mean of its divisors is an integer number (57428920606348).
Almost surely, 2201001222122211 is an apocalyptic number.
201001222122211 is a deficient number, since it is larger than the sum of its proper divisors (28714460303181).
201001222122211 is an equidigital number, since it uses as much as digits as its factorization.
201001222122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28714460303180.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 201001222122211 its reverse (112221222100102), we get a palindrome (313222444222313).
The spelling of 201001222122211 in words is "two hundred one trillion, one billion, two hundred twenty-two million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •