Base | Representation |
---|---|
bin | 101101101110100011001110… |
… | …010011111110001110011011 |
3 | 222101002000200001222021200201 |
4 | 231232203032103332032123 |
5 | 202330000322030310021 |
6 | 1551421042245443031 |
7 | 60234535210505563 |
oct | 5556431623761633 |
9 | 871060601867621 |
10 | 201111010010011 |
11 | 59097778219872 |
12 | 1a6807b2410477 |
13 | 882a8c1087a7a |
14 | 3793b79445da3 |
15 | 183b55b40a591 |
hex | b6e8ce4fe39b |
201111010010011 has 16 divisors (see below), whose sum is σ = 211934318080320. Its totient is φ = 190461009587200.
The previous prime is 201111010009981. The next prime is 201111010010021. The reversal of 201111010010011 is 110010010111102.
It is a cyclic number.
It is not a de Polignac number, because 201111010010011 - 213 = 201111010001819 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201111010010011.
It is not an unprimeable number, because it can be changed into a prime (201111010010021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 442092771 + ... + 442547443.
It is an arithmetic number, because the mean of its divisors is an integer number (13245894880020).
Almost surely, 2201111010010011 is an apocalyptic number.
201111010010011 is a deficient number, since it is larger than the sum of its proper divisors (10823308070309).
201111010010011 is a wasteful number, since it uses less digits than its factorization.
201111010010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645206.
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 201111010010011 its reverse (110010010111102), we get a palindrome (311121020121113).
The spelling of 201111010010011 in words is "two hundred one trillion, one hundred eleven billion, ten million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •