Search a number
-
+
101102110020 = 223253729695113
BaseRepresentation
bin101111000101000100…
…1111100010101000100
3100122221222110022222100
41132022021330111010
53124024120010040
6114240133032100
710206255520152
oct1361211742504
9318858408870
10101102110020
113997156172a
1217716a85630
1396c2c4b952
144c7158c3d2
15296ad8ab30
hex178a27c544

101102110020 has 144 divisors (see below), whose sum is σ = 315132657840. Its totient is φ = 26217934848.

The previous prime is 101102110019. The next prime is 101102110027. The reversal of 101102110020 is 20011201101.

It is a happy number.

It can be written as a sum of positive squares in 8 ways, for example, as 26759725056 + 74342384964 = 163584^2 + 272658^2 .

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a junction number, because it is equal to n+sod(n) for n = 101102109984 and 101102110011.

It is not an unprimeable number, because it can be changed into a prime (101102110027) 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 47 ways as a sum of consecutive naturals, for example, 19770984 + ... + 19776096.

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

Almost surely, 2101102110020 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 101102110020, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157566328920).

101102110020 is an abundant number, since it is smaller than the sum of its proper divisors (214030547820).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 4, while the sum is 9.

Adding to 101102110020 its reverse (20011201101), we get a palindrome (121113311121).

The spelling of 101102110020 in words is "one hundred one billion, one hundred two million, one hundred ten thousand, twenty".

Divisors: 1 2 3 4 5 6 9 10 12 15 18 20 30 36 37 45 60 74 90 111 148 180 185 222 333 370 444 555 666 740 1110 1332 1665 2220 2969 3330 5113 5938 6660 8907 10226 11876 14845 15339 17814 20452 25565 26721 29690 30678 35628 44535 46017 51130 53442 59380 61356 76695 89070 92034 102260 106884 109853 133605 153390 178140 184068 189181 219706 230085 267210 306780 329559 378362 439412 460170 534420 549265 567543 659118 756724 920340 945905 988677 1098530 1135086 1318236 1647795 1702629 1891810 1977354 2197060 2270172 2837715 3295590 3405258 3783620 3954708 4943385 5675430 6591180 6810516 8513145 9886770 11350860 15180497 17026290 19773540 30360994 34052580 45541491 60721988 75902485 91082982 136624473 151804970 182165964 227707455 273248946 303609940 455414910 546497892 561678389 683122365 910829820 1123356778 1366244730 1685035167 2246713556 2732489460 2808391945 3370070334 5055105501 5616783890 6740140668 8425175835 10110211002 11233567780 16850351670 20220422004 25275527505 33700703340 50551055010 101102110020