Base | Representation |
---|---|
bin | 110000101000010010… |
… | …1100100010000001000 |
3 | 100222112222210200001010 |
4 | 1201100211210100020 |
5 | 3202333344141300 |
6 | 115550335523520 |
7 | 10354621616100 |
oct | 1412045442010 |
9 | 328488720033 |
10 | 104431240200 |
11 | 4031a792491 |
12 | 182a59895a0 |
13 | 9b03890071 |
14 | 50a978c200 |
15 | 2ab3294a50 |
hex | 1850964408 |
104431240200 has 144 divisors (see below), whose sum is σ = 376591945680. Its totient is φ = 23869991040.
The previous prime is 104431240153. The next prime is 104431240201. The reversal of 104431240200 is 2042134401.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (104431240201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1746642 + ... + 1805441.
It is an arithmetic number, because the mean of its divisors is an integer number (2615221845).
Almost surely, 2104431240200 is an apocalyptic number.
104431240200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104431240200 is an abundant number, since it is smaller than the sum of its proper divisors (272160705480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104431240200 is a wasteful number, since it uses less digits than its factorization.
104431240200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3552116 (or 3552100 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 104431240200 its reverse (2042134401), we get a palindrome (106473374601).
The spelling of 104431240200 in words is "one hundred four billion, four hundred thirty-one million, two hundred forty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •