Base | Representation |
---|---|
bin | 110010101000100100… |
… | …0111000010110000110 |
3 | 101101122221221221020110 |
4 | 1211101020320112012 |
5 | 3240142234333323 |
6 | 121541414213450 |
7 | 10566365126010 |
oct | 1452110702606 |
9 | 341587857213 |
10 | 108735464838 |
11 | 42129376130 |
12 | 190a7354286 |
13 | a33b52b450 |
14 | 53972951b0 |
15 | 2c660b0793 |
hex | 1951238586 |
108735464838 has 512 divisors, whose sum is σ = 339725352960. Its totient is φ = 22225674240.
The previous prime is 108735464797. The next prime is 108735464843. The reversal of 108735464838 is 838464537801.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 44617356 + ... + 44619792.
It is an arithmetic number, because the mean of its divisors is an integer number (663526080).
Almost surely, 2108735464838 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 108735464838, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169862676480).
108735464838 is an abundant number, since it is smaller than the sum of its proper divisors (230989888122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108735464838 is a wasteful number, since it uses less digits than its factorization.
108735464838 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2532.
The product of its (nonzero) digits is 15482880, while the sum is 57.
The spelling of 108735464838 in words is "one hundred eight billion, seven hundred thirty-five million, four hundred sixty-four thousand, eight hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •