Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …0001001101000111111 |
3 | 201012211210200022122100 |
4 | 2323031030021220333 |
5 | 11243132304310421 |
6 | 232202043320143 |
7 | 20344145252232 |
oct | 2731514115077 |
9 | 635753608570 |
10 | 201011010111 |
11 | 7828052504a |
12 | 32b5a220053 |
13 | 15c55912902 |
14 | 9a2c497419 |
15 | 53670ccc26 |
hex | 2ecd309a3f |
201011010111 has 24 divisors (see below), whose sum is σ = 298263652544. Its totient is φ = 130356164160.
The previous prime is 201011010073. The next prime is 201011010133. The reversal of 201011010111 is 111010110102.
It is not a de Polignac number, because 201011010111 - 218 = 201010747967 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201011010093 and 201011010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201011010181) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1465146 + ... + 1596456.
Almost surely, 2201011010111 is an apocalyptic number.
201011010111 is a deficient number, since it is larger than the sum of its proper divisors (97252642433).
201011010111 is a wasteful number, since it uses less digits than its factorization.
201011010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135951 (or 135948 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 201011010111 its reverse (111010110102), we get a palindrome (312021120213).
Subtracting from 201011010111 its reverse (111010110102), we obtain a palindrome (90000900009).
The spelling of 201011010111 in words is "two hundred one billion, eleven million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •