Base | Representation |
---|---|
bin | 101100111001001110000… |
… | …111000110111010011000 |
3 | 101220221011201022000102210 |
4 | 230321032013012322120 |
5 | 401021234313122241 |
6 | 10321135103355120 |
7 | 435614402601510 |
oct | 54711607067230 |
9 | 11827151260383 |
10 | 3085097004696 |
11 | a8a422915933 |
12 | 419ab48b2aa0 |
13 | 194c00928915 |
14 | a9468984840 |
15 | 553b542b316 |
hex | 2ce4e1c6e98 |
3085097004696 has 128 divisors (see below), whose sum is σ = 9099828264960. Its totient is φ = 852935529600.
The previous prime is 3085097004653. The next prime is 3085097004733. The reversal of 3085097004696 is 6964007905803.
It is a happy number.
3085097004696 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 64508425 + ... + 64556231.
It is an arithmetic number, because the mean of its divisors is an integer number (71092408320).
Almost surely, 23085097004696 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 3085097004696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4549914132480).
3085097004696 is an abundant number, since it is smaller than the sum of its proper divisors (6014731260264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3085097004696 is a wasteful number, since it uses less digits than its factorization.
3085097004696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60245 (or 60241 counting only the distinct ones).
The product of its (nonzero) digits is 9797760, while the sum is 57.
The spelling of 3085097004696 in words is "three trillion, eighty-five billion, ninety-seven million, four thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •