Base | Representation |
---|---|
bin | 100111101001111110… |
… | …0101000000000000000 |
3 | 22010210222001122000000 |
4 | 1033103330220000000 |
5 | 2343402011414210 |
6 | 103042212000000 |
7 | 6103231204062 |
oct | 1172374500000 |
9 | 263728048000 |
10 | 85160263680 |
11 | 33130826608 |
12 | 14608000000 |
13 | 805224718b |
14 | 419c237732 |
15 | 2336530ac0 |
hex | 13d3f28000 |
85160263680 has 896 divisors, whose sum is σ = 330069911040. Its totient is φ = 21021327360.
The previous prime is 85160263663. The next prime is 85160263687. The reversal of 85160263680 is 8636206158.
85160263680 is a `hidden beast` number, since 8 + 5 + 1 + 6 + 0 + 2 + 636 + 8 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (85160263687) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 2747105265 + ... + 2747105295.
Almost surely, 285160263680 is an apocalyptic number.
85160263680 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 85160263680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165034955520).
85160263680 is an abundant number, since it is smaller than the sum of its proper divisors (244909647360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85160263680 is an frugal number, since it uses more digits than its factorization.
85160263680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107 (or 64 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 45.
The spelling of 85160263680 in words is "eighty-five billion, one hundred sixty million, two hundred sixty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •