Base | Representation |
---|---|
bin | 110000100101010110… |
… | …1000101001101010110 |
3 | 100222022010002112021210 |
4 | 1201022231011031112 |
5 | 3202133113000102 |
6 | 115532452322250 |
7 | 10352313005403 |
oct | 1411255051526 |
9 | 328263075253 |
10 | 104332546902 |
11 | 4027a003781 |
12 | 18278913386 |
13 | 9ab92b626c |
14 | 509a61b2aa |
15 | 2aa979c36c |
hex | 184ab45356 |
104332546902 has 32 divisors (see below), whose sum is σ = 209191973760. Its totient is φ = 34689802880.
The previous prime is 104332546853. The next prime is 104332546909. The reversal of 104332546902 is 209645233401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104332546909) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 4467877 + ... + 4491167.
It is an arithmetic number, because the mean of its divisors is an integer number (6537249180).
Almost surely, 2104332546902 is an apocalyptic number.
104332546902 is an abundant number, since it is smaller than the sum of its proper divisors (104859426858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104332546902 is a wasteful number, since it uses less digits than its factorization.
104332546902 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25148.
The product of its (nonzero) digits is 155520, while the sum is 39.
The spelling of 104332546902 in words is "one hundred four billion, three hundred thirty-two million, five hundred forty-six thousand, nine hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •