Search a number
-
+
104874813100 = 22521048748131
BaseRepresentation
bin110000110101100000…
…1101010011010101100
3101000200220110111200001
41201223001222122230
53204240423004400
6120102343114044
710401616126411
oct1415301523254
9330626414601
10104874813100
1140528109362
12183aa442924
139b74749535
14510c656108
152adc1b3a6a
hex186b06a6ac

104874813100 has 18 divisors (see below), whose sum is σ = 227578344644. Its totient is φ = 41949925200.

The previous prime is 104874813077. The next prime is 104874813151. The reversal of 104874813100 is 1318478401.

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

It is a self number, because there is not a number n which added to its sum of digits gives 104874813100.

It is an unprimeable number.

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 5 ways as a sum of consecutive naturals, for example, 524373966 + ... + 524374165.

Almost surely, 2104874813100 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

The spelling of 104874813100 in words is "one hundred four billion, eight hundred seventy-four million, eight hundred thirteen thousand, one hundred".

Divisors: 1 2 4 5 10 20 25 50 100 1048748131 2097496262 4194992524 5243740655 10487481310 20974962620 26218703275 52437406550 104874813100