Base | Representation |
---|---|
bin | 110010111110111… |
… | …001101100110000 |
3 | 2012121111021201000 |
4 | 302332321230300 |
5 | 3222432200224 |
6 | 220513042000 |
7 | 30124232652 |
oct | 6276715460 |
9 | 2177437630 |
10 | 855350064 |
11 | 3a9906188 |
12 | 1ba556300 |
13 | 1082924ca |
14 | 818566d2 |
15 | 5015c0c9 |
hex | 32fb9b30 |
855350064 has 160 divisors (see below), whose sum is σ = 2528409600. Its totient is φ = 276756480.
The previous prime is 855350063. The next prime is 855350117. The reversal of 855350064 is 460053558.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (855350063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2422912 + ... + 2423264.
It is an arithmetic number, because the mean of its divisors is an integer number (15802560).
Almost surely, 2855350064 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 855350064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1264204800).
855350064 is an abundant number, since it is smaller than the sum of its proper divisors (1673059536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
855350064 is a wasteful number, since it uses less digits than its factorization.
855350064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 520 (or 508 counting only the distinct ones).
The product of its (nonzero) digits is 72000, while the sum is 36.
The square root of 855350064 is about 29246.3683899386. The cubic root of 855350064 is about 949.2515116344.
The spelling of 855350064 in words is "eight hundred fifty-five million, three hundred fifty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •