Base | Representation |
---|---|
bin | 101101101110100100001001… |
… | …111011000101111110010111 |
3 | 222101002010020202212012012120 |
4 | 231232210021323011332113 |
5 | 202330004344042333421 |
6 | 1551421325413351023 |
7 | 60234602043351435 |
oct | 5556441173057627 |
9 | 871063222765176 |
10 | 201112010121111 |
11 | 59098140809071 |
12 | 1a680a31338473 |
13 | 882aa2033369b |
14 | 3793c321c1d55 |
15 | 183b5b910e8c6 |
hex | b6e909ec5f97 |
201112010121111 has 8 divisors (see below), whose sum is σ = 275396626472304. Its totient is φ = 130451033592000.
The previous prime is 201112010121059. The next prime is 201112010121149. The reversal of 201112010121111 is 111121010211102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201112010121111 - 241 = 198912986865559 is a prime.
It is a super-2 number, since 2×2011120101211112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201112010121511) 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, 905909955390 + ... + 905909955611.
It is an arithmetic number, because the mean of its divisors is an integer number (34424578309038).
Almost surely, 2201112010121111 is an apocalyptic number.
201112010121111 is a deficient number, since it is larger than the sum of its proper divisors (74284616351193).
201112010121111 is a wasteful number, since it uses less digits than its factorization.
201112010121111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1811819911041.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 201112010121111 its reverse (111121010211102), we get a palindrome (312233020332213).
The spelling of 201112010121111 in words is "two hundred one trillion, one hundred twelve billion, ten million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •