Search a number
-
+
1009901040148 = 22711213233132159
BaseRepresentation
bin11101011001000101100…
…10101111001000010100
310120112201201222101012201
432230202302233020110
5113021234131241043
62051535300054244
7132651201130210
oct16544262571024
93515651871181
101009901040148
1135a329899a00
12143885994384
1374305617a90
1436c453a9940
151b40aac7c4d
hexeb22caf214

1009901040148 has 288 divisors, whose sum is σ = 2575401615360. Its totient is φ = 336192595200.

The previous prime is 1009901040103. The next prime is 1009901040173. The reversal of 1009901040148 is 8410401099001.

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

It is a congruent number.

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 95 ways as a sum of consecutive naturals, for example, 31387293 + ... + 31419451.

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

Almost surely, 21009901040148 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 1009901040148, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1287700807680).

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

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

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

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

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

The product of its (nonzero) digits is 10368, while the sum is 37.

The spelling of 1009901040148 in words is "one trillion, nine billion, nine hundred one million, forty thousand, one hundred forty-eight".