Base | Representation |
---|---|
bin | 100111111110101100… |
… | …0100010100000001010 |
3 | 22012121102011121022020 |
4 | 1033331120202200022 |
5 | 2401312443301200 |
6 | 103235204105310 |
7 | 6126402154542 |
oct | 1177530424012 |
9 | 265542147266 |
10 | 85855447050 |
11 | 3345818611a |
12 | 14780995236 |
13 | 813328b099 |
14 | 42266ba322 |
15 | 23775a0ea0 |
hex | 13fd62280a |
85855447050 has 96 divisors (see below), whose sum is σ = 220098531840. Its totient is φ = 22125139200.
The previous prime is 85855447049. The next prime is 85855447057. The reversal of 85855447050 is 5074455858.
It is a junction number, because it is equal to n+sod(n) for n = 85855446984 and 85855447002.
It is not an unprimeable number, because it can be changed into a prime (85855447057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3395856 + ... + 3421044.
It is an arithmetic number, because the mean of its divisors is an integer number (2292693040).
Almost surely, 285855447050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 85855447050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110049265920).
85855447050 is an abundant number, since it is smaller than the sum of its proper divisors (134243084790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85855447050 is a wasteful number, since it uses less digits than its factorization.
85855447050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25968 (or 25963 counting only the distinct ones).
The product of its (nonzero) digits is 4480000, while the sum is 51.
The spelling of 85855447050 in words is "eighty-five billion, eight hundred fifty-five million, four hundred forty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •