Base | Representation |
---|---|
bin | 10111101110011000000011… |
… | …110110100101101110111101 |
3 | 111200102222221101120222101120 |
4 | 113232120003312211232331 |
5 | 102134014404013143010 |
6 | 1005530015250301153 |
7 | 30656314014250410 |
oct | 2756300366455675 |
9 | 450388841528346 |
10 | 104342000131005 |
11 | 3027921497a10a |
12 | b8522188877b9 |
13 | 462b5403146b0 |
14 | 1baa273351b77 |
15 | c0e29530be70 |
hex | 5ee603da5bbd |
104342000131005 has 128 divisors (see below), whose sum is σ = 205990075683840. Its totient is φ = 43919465103360.
The previous prime is 104342000130967. The next prime is 104342000131007. The reversal of 104342000131005 is 500131000243401.
It is a happy number.
It is not a de Polignac number, because 104342000131005 - 229 = 104341463260093 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104342000131007) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 910328079 + ... + 910442691.
It is an arithmetic number, because the mean of its divisors is an integer number (1609297466280).
Almost surely, 2104342000131005 is an apocalyptic number.
104342000131005 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
104342000131005 is a deficient number, since it is larger than the sum of its proper divisors (101648075552835).
104342000131005 is a wasteful number, since it uses less digits than its factorization.
104342000131005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116311.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 104342000131005 its reverse (500131000243401), we get a palindrome (604473000374406).
The spelling of 104342000131005 in words is "one hundred four trillion, three hundred forty-two billion, one hundred thirty-one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •