Base | Representation |
---|---|
bin | 101101110000000000100010… |
… | …000110111000010110001011 |
3 | 222101102121021111022210212020 |
4 | 231300000202012320112023 |
5 | 202333121014212041021 |
6 | 1551535052123215523 |
7 | 60245013053355405 |
oct | 5560004206702613 |
9 | 871377244283766 |
10 | 201211200112011 |
11 | 59126210997361 |
12 | 1a6980b39775a3 |
13 | 883719a0974ab |
14 | 379896182db75 |
15 | 183de721967c6 |
hex | b700221b858b |
201211200112011 has 8 divisors (see below), whose sum is σ = 276935845315584. Its totient is φ = 129813677491560.
The previous prime is 201211200112007. The next prime is 201211200112037. The reversal of 201211200112011 is 110211002112102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201211200112011 - 22 = 201211200112007 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201211200112061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1081780645671 + ... + 1081780645856.
It is an arithmetic number, because the mean of its divisors is an integer number (34616980664448).
Almost surely, 2201211200112011 is an apocalyptic number.
201211200112011 is a deficient number, since it is larger than the sum of its proper divisors (75724645203573).
201211200112011 is a wasteful number, since it uses less digits than its factorization.
201211200112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2163561291561.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201211200112011 its reverse (110211002112102), we get a palindrome (311422202224113).
The spelling of 201211200112011 in words is "two hundred one trillion, two hundred eleven billion, two hundred million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •