Base | Representation |
---|---|
bin | 110011000000011… |
… | …001010101001000 |
3 | 2012122020012000120 |
4 | 303000121111020 |
5 | 3223032214033 |
6 | 220525303240 |
7 | 30130453650 |
oct | 6300312510 |
9 | 2178205016 |
10 | 855741768 |
11 | 3aa053502 |
12 | 1ba704b20 |
13 | 10839b89b |
14 | 81919360 |
15 | 501d81b3 |
hex | 33019548 |
855741768 has 64 divisors (see below), whose sum is σ = 2466668160. Its totient is φ = 242328576.
The previous prime is 855741751. The next prime is 855741827. The reversal of 855741768 is 867147558.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 855741768.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3555 + ... + 41522.
It is an arithmetic number, because the mean of its divisors is an integer number (38541690).
Almost surely, 2855741768 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 855741768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1233334080).
855741768 is an abundant number, since it is smaller than the sum of its proper divisors (1610926392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
855741768 is a wasteful number, since it uses less digits than its factorization.
855741768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45206 (or 45202 counting only the distinct ones).
The product of its digits is 1881600, while the sum is 51.
The square root of 855741768 is about 29253.0642497500. The cubic root of 855741768 is about 949.3963914466.
The spelling of 855741768 in words is "eight hundred fifty-five million, seven hundred forty-one thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •