Base | Representation |
---|---|
bin | 11000111110001101101110… |
… | …111100010010101111110000 |
3 | 112101212111110220122020010110 |
4 | 120332031232330102233300 |
5 | 103343412201311301300 |
6 | 1025330300321101320 |
7 | 32063562605011503 |
oct | 3076155674225760 |
9 | 471774426566113 |
10 | 109828470025200 |
11 | 31aa3aa111a343 |
12 | 103995b0487840 |
13 | 4938a1b38b754 |
14 | 1d19a2500113a |
15 | ca6d558eb550 |
hex | 63e36ef12bf0 |
109828470025200 has 120 divisors (see below), whose sum is σ = 370333893740800. Its totient is φ = 27746139790080.
The previous prime is 109828470025199. The next prime is 109828470025217. The reversal of 109828470025200 is 2520074828901.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 109828470025200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2408496280 + ... + 2408541879.
Almost surely, 2109828470025200 is an apocalyptic number.
109828470025200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
109828470025200 is an abundant number, since it is smaller than the sum of its proper divisors (260505423715600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109828470025200 is a wasteful number, since it uses less digits than its factorization.
109828470025200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4817038199 (or 4817038188 counting only the distinct ones).
The product of its (nonzero) digits is 645120, while the sum is 48.
The spelling of 109828470025200 in words is "one hundred nine trillion, eight hundred twenty-eight billion, four hundred seventy million, twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •