Base | Representation |
---|---|
bin | 100111101000000100… |
… | …1101001010010101100 |
3 | 22010122112012112221000 |
4 | 1033100021221102230 |
5 | 2343234210133410 |
6 | 103032014440300 |
7 | 6101525615244 |
oct | 1172011512254 |
9 | 263575175830 |
10 | 85096567980 |
11 | 330a8881036 |
12 | 145aa803090 |
13 | 8041ca5008 |
14 | 41939b6b24 |
15 | 2330b4cdc0 |
hex | 13d02694ac |
85096567980 has 192 divisors, whose sum is σ = 274711449600. Its totient is φ = 21845790720.
The previous prime is 85096567877. The next prime is 85096567987. The reversal of 85096567980 is 8976569058.
85096567980 is a `hidden beast` number, since 8 + 509 + 6 + 56 + 79 + 8 + 0 = 666.
It is a super-2 number, since 2×850965679802 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (85096567987) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3217651 + ... + 3243989.
It is an arithmetic number, because the mean of its divisors is an integer number (1430788800).
Almost surely, 285096567980 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 85096567980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137355724800).
85096567980 is an abundant number, since it is smaller than the sum of its proper divisors (189614881620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85096567980 is a wasteful number, since it uses less digits than its factorization.
85096567980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26581 (or 26573 counting only the distinct ones).
The product of its (nonzero) digits is 32659200, while the sum is 63.
The spelling of 85096567980 in words is "eighty-five billion, ninety-six million, five hundred sixty-seven thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •