Search a number
-
+
104039510932 = 2273715696819
BaseRepresentation
bin110000011100100111…
…1001111001110010100
3100221112200200202111201
41200321033033032110
53201033103322212
6115443423442244
710342124152210
oct1407117171624
9327480622451
10104039510932
1140139656495
12181b6756384
139a706861b6
14506d73b940
152a8dbb6b57
hex18393cf394

104039510932 has 12 divisors (see below), whose sum is σ = 208079021920. Its totient is φ = 44588361816.

The previous prime is 104039510923. The next prime is 104039510989. The reversal of 104039510932 is 239015930401.

104039510932 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

104039510932 is an admirable number.

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

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 3 ways as a sum of consecutive naturals, for example, 1857848382 + ... + 1857848437.

Almost surely, 2104039510932 is an apocalyptic number.

It is an amenable number.

104039510932 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

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

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

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

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

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

The spelling of 104039510932 in words is "one hundred four billion, thirty-nine million, five hundred ten thousand, nine hundred thirty-two".

Divisors: 1 2 4 7 14 28 3715696819 7431393638 14862787276 26009877733 52019755466 104039510932