Base | Representation |
---|---|
bin | 10011010100111101100011… |
… | …111101011110001000000000 |
3 | 102010222020120100021110010000 |
4 | 103110331203331132020000 |
5 | 42120143402423014241 |
6 | 500442002235040000 |
7 | 23622201604250463 |
oct | 2324754375361000 |
9 | 363866510243100 |
10 | 85003374813696 |
11 | 250a280205a129 |
12 | 964a2822a0000 |
13 | 3857a26171361 |
14 | 16dc28462d2da |
15 | 9c61ed589eb6 |
hex | 4d4f63f5e200 |
85003374813696 has 400 divisors, whose sum is σ = 254832529504608. Its totient is φ = 28209575116800.
The previous prime is 85003374813673. The next prime is 85003374813703. The reversal of 85003374813696 is 69631847330058.
85003374813696 is a `hidden beast` number, since 8 + 5 + 0 + 0 + 3 + 37 + 481 + 36 + 96 = 666.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 18307853551 + ... + 18307858193.
Almost surely, 285003374813696 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 85003374813696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127416264752304).
85003374813696 is an abundant number, since it is smaller than the sum of its proper divisors (169829154690912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85003374813696 is a wasteful number, since it uses less digits than its factorization.
85003374813696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6525 (or 6500 counting only the distinct ones).
The product of its (nonzero) digits is 78382080, while the sum is 63.
The spelling of 85003374813696 in words is "eighty-five trillion, three billion, three hundred seventy-four million, eight hundred thirteen thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •