Base | Representation |
---|---|
bin | 10111101110010110001110… |
… | …100011001001111100111000 |
3 | 111200102210212020101202101211 |
4 | 113232112032203021330320 |
5 | 102134001341204232300 |
6 | 1005525052104452504 |
7 | 30656214156264166 |
oct | 2756261643117470 |
9 | 450383766352354 |
10 | 104340032102200 |
11 | 302783a4a89a24 |
12 | b85196977a134 |
13 | 462b2b86825cb |
14 | 1baa127c1a236 |
15 | c0e1cc6624ba |
hex | 5ee58e8c9f38 |
104340032102200 has 24 divisors (see below), whose sum is σ = 242590574638080. Its totient is φ = 41736012840800.
The previous prime is 104340032102113. The next prime is 104340032102203. The reversal of 104340032102200 is 2201230043401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104340032102203) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 260850080056 + ... + 260850080455.
It is an arithmetic number, because the mean of its divisors is an integer number (10107940609920).
Almost surely, 2104340032102200 is an apocalyptic number.
104340032102200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
104340032102200 is an abundant number, since it is smaller than the sum of its proper divisors (138250542535880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104340032102200 is a wasteful number, since it uses less digits than its factorization.
104340032102200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 521700160527 (or 521700160518 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 104340032102200 its reverse (2201230043401), we get a palindrome (106541262145601).
The spelling of 104340032102200 in words is "one hundred four trillion, three hundred forty billion, thirty-two million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •