Base | Representation |
---|---|
bin | 110000110100111100… |
… | …0110111111111110100 |
3 | 101000122120120002121111 |
4 | 1201221320313333310 |
5 | 3204221031412322 |
6 | 120100422124404 |
7 | 10401265006120 |
oct | 1415170677764 |
9 | 330576502544 |
10 | 104855732212 |
11 | 40518366630 |
12 | 183a3b80704 |
13 | 9b707c857a |
14 | 5109cca580 |
15 | 2ada695177 |
hex | 1869e37ff4 |
104855732212 has 144 divisors (see below), whose sum is σ = 242939547648. Its totient is φ = 38464165440.
The previous prime is 104855732143. The next prime is 104855732213. The reversal of 104855732212 is 212237558401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104855732213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 18565573 + ... + 18571219.
It is an arithmetic number, because the mean of its divisors is an integer number (1687080192).
Almost surely, 2104855732212 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 104855732212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121469773824).
104855732212 is an abundant number, since it is smaller than the sum of its proper divisors (138083815436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104855732212 is a wasteful number, since it uses less digits than its factorization.
104855732212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5874 (or 5853 counting only the distinct ones).
The product of its (nonzero) digits is 134400, while the sum is 40.
The spelling of 104855732212 in words is "one hundred four billion, eight hundred fifty-five million, seven hundred thirty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •