Search a number
-
+
101540265888 = 25331137271919
BaseRepresentation
bin101111010010001000…
…1010111111110100000
3100201002111220221211110
41132210101113332200
53130423302002023
6114351424143320
710223156006415
oct1364421277640
9321074827743
10101540265888
113a076918716
1217819767b40
13976295c589
144cb384610c
152994589a93
hex17a4457fa0

101540265888 has 192 divisors, whose sum is σ = 278475079680. Its totient is φ = 32360601600.

The previous prime is 101540265881. The next prime is 101540265901. The reversal of 101540265888 is 888562045101.

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

It is not an unprimeable number, because it can be changed into a prime (101540265881) by changing a digit.

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, 110489493 + ... + 110490411.

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

Almost surely, 2101540265888 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

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

The product of its (nonzero) digits is 614400, while the sum is 48.

The spelling of 101540265888 in words is "one hundred one billion, five hundred forty million, two hundred sixty-five thousand, eight hundred eighty-eight".