Base | Representation |
---|---|
bin | 110000100010100101… |
… | …1001011111100111110 |
3 | 100222001122112020220210 |
4 | 1201011023023330332 |
5 | 3201440340304200 |
6 | 115515340053250 |
7 | 10350105321111 |
oct | 1410513137476 |
9 | 328048466823 |
10 | 104239775550 |
11 | 402316aa239 |
12 | 18251834226 |
13 | 9aa3003a81 |
14 | 508c18c578 |
15 | 2aa1574650 |
hex | 18452cbf3e |
104239775550 has 96 divisors (see below), whose sum is σ = 265055535360. Its totient is φ = 27095161600.
The previous prime is 104239775539. The next prime is 104239775567. The reversal of 104239775550 is 55577932401.
It is a self number, because there is not a number n which added to its sum of digits gives 104239775550.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7514521 + ... + 7528379.
It is an arithmetic number, because the mean of its divisors is an integer number (2760995160).
Almost surely, 2104239775550 is an apocalyptic number.
104239775550 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 104239775550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132527767680).
104239775550 is an abundant number, since it is smaller than the sum of its proper divisors (160815759810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104239775550 is a wasteful number, since it uses less digits than its factorization.
104239775550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15138 (or 15133 counting only the distinct ones).
The product of its (nonzero) digits is 1323000, while the sum is 48.
The spelling of 104239775550 in words is "one hundred four billion, two hundred thirty-nine million, seven hundred seventy-five thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •