Base | Representation |
---|---|
bin | 10001101101101111000… |
… | …111001001000111011000 |
3 | 11022101011111202200200210 |
4 | 101231233013021013120 |
5 | 124421103002404323 |
6 | 2331123242331120 |
7 | 153643550214432 |
oct | 21555707110730 |
9 | 4271144680623 |
10 | 1217339888088 |
11 | 42a2a86a3715 |
12 | 177b187b9aa0 |
13 | 8aa43b3380c |
14 | 42cc3401652 |
15 | 219ec150293 |
hex | 11b6f1c91d8 |
1217339888088 has 256 divisors, whose sum is σ = 3248249241600. Its totient is φ = 379619136000.
The previous prime is 1217339888077. The next prime is 1217339888099. The reversal of 1217339888088 is 8808889337121.
It is an interprime number because it is at equal distance from previous prime (1217339888077) and next prime (1217339888099).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 942942723 + ... + 942944013.
It is an arithmetic number, because the mean of its divisors is an integer number (12688473600).
Almost surely, 21217339888088 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1217339888088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1624124620800).
1217339888088 is an abundant number, since it is smaller than the sum of its proper divisors (2030909353512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1217339888088 is a wasteful number, since it uses less digits than its factorization.
1217339888088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1734 (or 1730 counting only the distinct ones).
The product of its (nonzero) digits is 37158912, while the sum is 66.
The spelling of 1217339888088 in words is "one trillion, two hundred seventeen billion, three hundred thirty-nine million, eight hundred eighty-eight thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •