Base | Representation |
---|---|
bin | 100111110110100001… |
… | …1101010000011011010 |
3 | 22011220022202120001000 |
4 | 1033231003222003122 |
5 | 2400232333144443 |
6 | 103152101205430 |
7 | 6116535031452 |
oct | 1175503520332 |
9 | 264808676030 |
10 | 85581537498 |
11 | 33327601896 |
12 | 14705100876 |
13 | 80bb5c6922 |
14 | 41dc178d62 |
15 | 235d4e78d3 |
hex | 13ed0ea0da |
85581537498 has 64 divisors (see below), whose sum is σ = 197862359040. Its totient is φ = 27389502000.
The previous prime is 85581537497. The next prime is 85581537541. The reversal of 85581537498 is 89473518558.
85581537498 is a `hidden beast` number, since 8 + 5 + 5 + 8 + 1 + 537 + 4 + 98 = 666.
It is not an unprimeable number, because it can be changed into a prime (85581537497) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11323 + ... + 413873.
It is an arithmetic number, because the mean of its divisors is an integer number (3091599360).
Almost surely, 285581537498 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 85581537498, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98931179520).
85581537498 is an abundant number, since it is smaller than the sum of its proper divisors (112280821542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85581537498 is a wasteful number, since it uses less digits than its factorization.
85581537498 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402720 (or 402714 counting only the distinct ones).
The product of its digits is 48384000, while the sum is 63.
The spelling of 85581537498 in words is "eighty-five billion, five hundred eighty-one million, five hundred thirty-seven thousand, four hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •