Base | Representation |
---|---|
bin | 101101101110101101011110… |
… | …000001011011000010110011 |
3 | 222101010002001202021112022211 |
4 | 231232231132001123002303 |
5 | 202330140334304013021 |
6 | 1551430102031112551 |
7 | 60235404631416622 |
oct | 5556553601330263 |
9 | 871102052245284 |
10 | 201122011001011 |
11 | 590a1402a74171 |
12 | 1a682962672757 |
13 | 882b95526b4b9 |
14 | 37945004d36b9 |
15 | 183b9a20e33e1 |
hex | b6eb5e05b0b3 |
201122011001011 has 8 divisors (see below), whose sum is σ = 201268325514960. Its totient is φ = 200975708086272.
The previous prime is 201122011000921. The next prime is 201122011001057. The reversal of 201122011001011 is 110100110221102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201122011001011 - 29 = 201122011000499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201122011000982 and 201122011001000.
It is not an unprimeable number, because it can be changed into a prime (201122011001081) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31943571 + ... + 37717843.
It is an arithmetic number, because the mean of its divisors is an integer number (25158540689370).
Almost surely, 2201122011001011 is an apocalyptic number.
201122011001011 is a deficient number, since it is larger than the sum of its proper divisors (146314513949).
201122011001011 is a wasteful number, since it uses less digits than its factorization.
201122011001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5799605.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 201122011001011 its reverse (110100110221102), we get a palindrome (311222121222113).
The spelling of 201122011001011 in words is "two hundred one trillion, one hundred twenty-two billion, eleven million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •