Base | Representation |
---|---|
bin | 110011000100011… |
… | …001011001111000 |
3 | 2012201012110210222 |
4 | 303010121121320 |
5 | 3223314300043 |
6 | 221003555212 |
7 | 30142412630 |
oct | 6304313170 |
9 | 2181173728 |
10 | 856790648 |
11 | 3aa6aa54a |
12 | 1bab2bb08 |
13 | 10867811c |
14 | 81b0d6c0 |
15 | 50343d68 |
hex | 33119678 |
856790648 has 64 divisors (see below), whose sum is σ = 1946572800. Its totient is φ = 345720960.
The previous prime is 856790591. The next prime is 856790651. The reversal of 856790648 is 846097658.
It is a super-3 number, since 3×8567906483 (a number of 28 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 856790648.
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, 57563 + ... + 70901.
It is an arithmetic number, because the mean of its divisors is an integer number (30415200).
Almost surely, 2856790648 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 856790648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (973286400).
856790648 is an abundant number, since it is smaller than the sum of its proper divisors (1089782152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
856790648 is a wasteful number, since it uses less digits than its factorization.
856790648 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13420 (or 13416 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 53.
The square root of 856790648 is about 29270.9864541665. The cubic root of 856790648 is about 949.7841238016.
The spelling of 856790648 in words is "eight hundred fifty-six million, seven hundred ninety thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •