Base | Representation |
---|---|
bin | 110000011111011000… |
… | …0110111010110010001 |
3 | 100221210011010110121210 |
4 | 1200332300313112101 |
5 | 3201230321241423 |
6 | 115500534410333 |
7 | 10344331125066 |
oct | 1407660672621 |
9 | 327704113553 |
10 | 104132212113 |
11 | 40186a12236 |
12 | 182218009a9 |
13 | 9a86942777 |
14 | 507bb8cc6d |
15 | 2a96dc8b93 |
hex | 183ec37591 |
104132212113 has 8 divisors (see below), whose sum is σ = 140071648608. Its totient is φ = 68807125184.
The previous prime is 104132212103. The next prime is 104132212133. The reversal of 104132212113 is 311212231401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104132212113 - 25 = 104132212081 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 104132212113.
It is not an unprimeable number, because it can be changed into a prime (104132212103) 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 7 ways as a sum of consecutive naturals, for example, 153586995 + ... + 153587672.
It is an arithmetic number, because the mean of its divisors is an integer number (17508956076).
Almost surely, 2104132212113 is an apocalyptic number.
It is an amenable number.
104132212113 is a deficient number, since it is larger than the sum of its proper divisors (35939436495).
104132212113 is a wasteful number, since it uses less digits than its factorization.
104132212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 307174783.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 104132212113 its reverse (311212231401), we get a palindrome (415344443514).
The spelling of 104132212113 in words is "one hundred four billion, one hundred thirty-two million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •