Base | Representation |
---|---|
bin | 1011101101001100101… |
… | …0000000001001010111 |
3 | 201020002210000221012012 |
4 | 2323103022000021113 |
5 | 11243333421011411 |
6 | 232220021014435 |
7 | 20346502142303 |
oct | 2732312001127 |
9 | 636083027165 |
10 | 201111110231 |
11 | 78321a84819 |
12 | 32b8785441b |
13 | 15c7058cb55 |
14 | 9a3b8b2d03 |
15 | 5370ca218b |
hex | 2ed3280257 |
201111110231 has 4 divisors (see below), whose sum is σ = 201214299000. Its totient is φ = 201007921464.
The previous prime is 201111110203. The next prime is 201111110257. The reversal of 201111110231 is 132011111102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201111110231 - 218 = 201110848087 is a prime.
It is a super-2 number, since 2×2011111102312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201116110231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 51591461 + ... + 51595358.
It is an arithmetic number, because the mean of its divisors is an integer number (50303574750).
Almost surely, 2201111110231 is an apocalyptic number.
201111110231 is a deficient number, since it is larger than the sum of its proper divisors (103188769).
201111110231 is a wasteful number, since it uses less digits than its factorization.
201111110231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103188768.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 201111110231 its reverse (132011111102), we get a palindrome (333122221333).
The spelling of 201111110231 in words is "two hundred one billion, one hundred eleven million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •