Search a number
-
+
101501150105 = 5194436014013
BaseRepresentation
bin101111010000111110…
…0001010001110011001
3100200222210022200001202
41132201330022032121
53130333243300410
6114343505523545
710222202353265
oct1364174121631
9320883280052
10101501150105
113a056831423
12178086435b5
139757815344
144cac5830a5
152990e0eca5
hex17a1f0a399

101501150105 has 32 divisors (see below), whose sum is σ = 128747283840. Its totient is φ = 76606732800.

The previous prime is 101501150083. The next prime is 101501150123. The reversal of 101501150105 is 501051105101.

It is not a de Polignac number, because 101501150105 - 212 = 101501146009 is a prime.

It is a super-2 number, since 2×1015011501052 (a number of 23 digits) contains 22 as substring.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25291079 + ... + 25295091.

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

Almost surely, 2101501150105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 5081.

The product of its (nonzero) digits is 125, while the sum is 20.

Adding to 101501150105 its reverse (501051105101), we get a palindrome (602552255206).

The spelling of 101501150105 in words is "one hundred one billion, five hundred one million, one hundred fifty thousand, one hundred five".

Divisors: 1 5 19 95 443 601 2215 3005 4013 8417 11419 20065 42085 57095 76247 266243 381235 1331215 1777759 2411813 5058617 8888795 12059065 25293085 33777421 45824447 168887105 229122235 1068433159 5342165795 20300230021 101501150105