Base | Representation |
---|---|
bin | 101101101110100010011110… |
… | …000110010011010101011011 |
3 | 222101001221120200220102022210 |
4 | 231232202132012103111123 |
5 | 202324442142441320331 |
6 | 1551420430112250203 |
7 | 60234506156165124 |
oct | 5556423606232533 |
9 | 871057520812283 |
10 | 201110201120091 |
11 | 590973a26668aa |
12 | 1a680607540963 |
13 | 882a7c2611693 |
14 | 3793addc4504b |
15 | 183b5103c9446 |
hex | b6e89e19355b |
201110201120091 has 8 divisors (see below), whose sum is σ = 268147455901200. Its totient is φ = 134073206876192.
The previous prime is 201110201120089. The next prime is 201110201120119. The reversal of 201110201120091 is 190021102011102.
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 201110201120091 - 21 = 201110201120089 is a prime.
It is a super-2 number, since 2×2011102011200912 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (201110201127091) 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, 63326016 + ... + 66425933.
It is an arithmetic number, because the mean of its divisors is an integer number (33518431987650).
Almost surely, 2201110201120091 is an apocalyptic number.
201110201120091 is a deficient number, since it is larger than the sum of its proper divisors (67037254781109).
201110201120091 is a wasteful number, since it uses less digits than its factorization.
201110201120091 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130268605.
The product of its (nonzero) digits is 72, while the sum is 21.
Adding to 201110201120091 its reverse (190021102011102), we get a palindrome (391131303131193).
The spelling of 201110201120091 in words is "two hundred one trillion, one hundred ten billion, two hundred one million, one hundred twenty thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •