Base | Representation |
---|---|
bin | 1010001110001… |
… | …10001111010000 |
3 | 12222100101021111 |
4 | 11013012033100 |
5 | 133422343030 |
6 | 12301503104 |
7 | 2060556130 |
oct | 507061720 |
9 | 188311244 |
10 | 85746640 |
11 | 444467a1 |
12 | 24871a94 |
13 | 149c2c75 |
14 | b560ac0 |
15 | 77db62a |
hex | 51c63d0 |
85746640 has 80 divisors (see below), whose sum is σ = 241270272. Its totient is φ = 27666432.
The previous prime is 85746631. The next prime is 85746653. The reversal of 85746640 is 4664758.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 85746593 and 85746602.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5017 + ... + 14023.
Almost surely, 285746640 is an apocalyptic number.
85746640 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 85746640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120635136).
85746640 is an abundant number, since it is smaller than the sum of its proper divisors (155523632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
85746640 is a wasteful number, since it uses less digits than its factorization.
85746640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9044 (or 9038 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 40.
The square root of 85746640 is about 9259.9481640018. The cubic root of 85746640 is about 440.9666077489.
The spelling of 85746640 in words is "eighty-five million, seven hundred forty-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •