Base | Representation |
---|---|
bin | 110000110100001111… |
… | …0101000101111001110 |
3 | 101000120221001021102021 |
4 | 1201220132220233032 |
5 | 3204144002424000 |
6 | 120054215120354 |
7 | 10400556643552 |
oct | 1415036505716 |
9 | 330527037367 |
10 | 104832076750 |
11 | 40505a79965 |
12 | 183980730ba |
13 | 9b6893535b |
14 | 5106acd862 |
15 | 2ad857111a |
hex | 18687a8bce |
104832076750 has 48 divisors (see below), whose sum is σ = 208468703664. Its totient is φ = 39466166400.
The previous prime is 104832076693. The next prime is 104832076753. The reversal of 104832076750 is 57670238401.
It is a hoax number, since the sum of its digits (43) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 104832076697 and 104832076706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104832076753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 653232 + ... + 797731.
It is an arithmetic number, because the mean of its divisors is an integer number (4343097993).
Almost surely, 2104832076750 is an apocalyptic number.
104832076750 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
104832076750 is a deficient number, since it is larger than the sum of its proper divisors (103636626914).
104832076750 is a wasteful number, since it uses less digits than its factorization.
104832076750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1451014 (or 1450987 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 43.
The spelling of 104832076750 in words is "one hundred four billion, eight hundred thirty-two million, seventy-six thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •