Base | Representation |
---|---|
bin | 110000100101001000… |
… | …1111100101111011100 |
3 | 100222021121201011200021 |
4 | 1201022101330233130 |
5 | 3202124302344312 |
6 | 115532040041524 |
7 | 10352165363140 |
oct | 1411221745734 |
9 | 328247634607 |
10 | 104325434332 |
11 | 40275a95a19 |
12 | 182764632a4 |
13 | 9ab7995a42 |
14 | 50996c9220 |
15 | 2aa8d44c07 |
hex | 184a47cbdc |
104325434332 has 24 divisors (see below), whose sum is σ = 209135001600. Its totient is φ = 44607157680.
The previous prime is 104325434329. The next prime is 104325434333. The reversal of 104325434332 is 233434523401.
104325434332 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104325434333) 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 7 ways as a sum of consecutive naturals, for example, 4310332 + ... + 4334467.
It is an arithmetic number, because the mean of its divisors is an integer number (8713958400).
Almost surely, 2104325434332 is an apocalyptic number.
It is an amenable number.
104325434332 is an abundant number, since it is smaller than the sum of its proper divisors (104809567268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104325434332 is a wasteful number, since it uses less digits than its factorization.
104325434332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8645241 (or 8645239 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 34.
Adding to 104325434332 its reverse (233434523401), we get a palindrome (337759957733).
The spelling of 104325434332 in words is "one hundred four billion, three hundred twenty-five million, four hundred thirty-four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •