Base | Representation |
---|---|
bin | 101101000101110000001… |
… | …100010010010000000000 |
3 | 101222012220112102102010000 |
4 | 231011300030102100000 |
5 | 401231314221022323 |
6 | 10331242251040000 |
7 | 436602022535514 |
oct | 55056014222000 |
9 | 11865815372100 |
10 | 3098553689088 |
11 | a950a8862000 |
12 | 42062b440000 |
13 | 1962667c7970 |
14 | a9d83c2c144 |
15 | 559019dbe43 |
hex | 2d170312400 |
3098553689088 has 1760 divisors, whose sum is σ = 11696469700608. Its totient is φ = 809321103360.
The previous prime is 3098553689051. The next prime is 3098553689123. The reversal of 3098553689088 is 8809863558903.
3098553689088 is a `hidden beast` number, since 3 + 0 + 9 + 8 + 5 + 536 + 8 + 9 + 0 + 88 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 24398060481 + ... + 24398060607.
Almost surely, 23098553689088 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 3098553689088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5848234850304).
3098553689088 is an abundant number, since it is smaller than the sum of its proper divisors (8597916011520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3098553689088 is a wasteful number, since it uses less digits than its factorization.
3098553689088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222 (or 173 counting only the distinct ones).
The product of its (nonzero) digits is 447897600, while the sum is 72.
The spelling of 3098553689088 in words is "three trillion, ninety-eight billion, five hundred fifty-three million, six hundred eighty-nine thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •