Search a number
-
+
201102001201101 = 371113243119797913
BaseRepresentation
bin101101101110011010110101…
…010110000101111111001101
3222101001011102020022101010110
4231232122311112011333031
5202324323344301413401
61551412552311430233
760234066030055560
oct5556326526057715
9871034366271113
10201102001201101
1159093974a61350
121a67aab9385379
138829ab6842100
143793562bba4d7
15183b1d058d9d6
hexb6e6b5585fcd

201102001201101 has 96 divisors (see below), whose sum is σ = 370411316554752. Its totient is φ = 94189910330880.

The previous prime is 201102001200917. The next prime is 201102001201117. The reversal of 201102001201101 is 101102100201102.

It is not a de Polignac number, because 201102001201101 - 215 = 201102001168333 is a prime.

It is a super-2 number, since 2×2011020012011012 (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 (201102001201121) 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 95 ways as a sum of consecutive naturals, for example, 58220280 + ... + 61577633.

It is an arithmetic number, because the mean of its divisors is an integer number (3858451214112).

Almost surely, 2201102001201101 is an apocalyptic number.

201102001201101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.

It is an amenable number.

201102001201101 is a deficient number, since it is larger than the sum of its proper divisors (169309315353651).

201102001201101 is a wasteful number, since it uses less digits than its factorization.

201102001201101 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 119798003 (or 119797990 counting only the distinct ones).

The product of its (nonzero) digits is 8, while the sum is 12.

Adding to 201102001201101 its reverse (101102100201102), we get a palindrome (302204101402203).

Subtracting from 201102001201101 its reverse (101102100201102), we obtain a palindrome (99999900999999).

It can be divided in two parts, 201102001 and 201101, that added together give a palindrome (201303102).

The spelling of 201102001201101 in words is "two hundred one trillion, one hundred two billion, one million, two hundred one thousand, one hundred one".

Divisors: 1 3 7 11 13 21 33 39 43 77 91 129 143 169 231 273 301 429 473 507 559 903 1001 1183 1419 1677 1859 3003 3311 3549 3913 5577 6149 7267 9933 11739 13013 18447 21801 39039 43043 50869 79937 129129 152607 239811 559559 1678677 119797913 359393739 838585391 1317777043 1557372869 2515756173 3953331129 4672118607 5151310259 9224439301 10901610083 15453930777 17131101559 20245847297 27673317903 32704830249 36059171813 51393304677 56664412849 60737541891 66967033367 108177515439 119917710913 141720931079 169993238547 200901100101 222704320267 359753132739 396650889943 425162793237 468769233569 668112960801 736637367037 870571433771 1189952669829 1406307700707 1558930241869 2209912101111 2611714301313 4676790725607 5156461569259 6094000036397 9576285771481 15469384707777 18282000109191 28728857314443 67034000400367 201102001201101