Base | Representation |
---|---|
bin | 1001000101101011101101… |
… | …1001110111000101000000 |
3 | 1022101100021221102120000000 |
4 | 2101122323121313011000 |
5 | 2302212122420032323 |
6 | 33130455153000000 |
7 | 2050662516613560 |
oct | 221327331670500 |
9 | 38340257376000 |
10 | 9993238049088 |
11 | 32031213a0238 |
12 | 115490b253000 |
13 | 57648726c438 |
14 | 26796505ada0 |
15 | 124e3149be43 |
hex | 916bb677140 |
9993238049088 has 448 divisors, whose sum is σ = 34238232768000. Its totient is φ = 2834331844608.
The previous prime is 9993238049077. The next prime is 9993238049089. The reversal of 9993238049088 is 8809408323999.
It is a tau number, because it is divible by the number of its divisors (448).
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (9993238049089) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 134192088 + ... + 134266536.
Almost surely, 29993238049088 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 9993238049088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17119116384000).
9993238049088 is an abundant number, since it is smaller than the sum of its proper divisors (24244994718912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
9993238049088 is an equidigital number, since it uses as much as digits as its factorization.
9993238049088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74626 (or 74598 counting only the distinct ones).
The product of its (nonzero) digits is 241864704, while the sum is 72.
The spelling of 9993238049088 in words is "nine trillion, nine hundred ninety-three billion, two hundred thirty-eight million, forty-nine thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •