Base | Representation |
---|---|
bin | 110000000011011… |
… | …011100101101000 |
3 | 2002012000111110002 |
4 | 300003123211220 |
5 | 3122342041200 |
6 | 211555442132 |
7 | 25656431141 |
oct | 6003334550 |
9 | 2065014402 |
10 | 806205800 |
11 | 38409a394 |
12 | 1a5bb6348 |
13 | cb04676a |
14 | 79102ac8 |
15 | 4aba0bd5 |
hex | 300db968 |
806205800 has 96 divisors (see below), whose sum is σ = 1960421400. Its totient is φ = 307937280.
The previous prime is 806205793. The next prime is 806205811. The reversal of 806205800 is 8502608.
It is a happy number.
It can be written as a sum of positive squares in 12 ways, for example, as 132388036 + 673817764 = 11506^2 + 25958^2 .
It is a Harshad number since it is a multiple of its sum of digits (29).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 561884 + ... + 563316.
Almost surely, 2806205800 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 806205800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (980210700).
806205800 is an abundant number, since it is smaller than the sum of its proper divisors (1154215600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
806205800 is a wasteful number, since it uses less digits than its factorization.
806205800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1575 (or 1566 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 29.
The square root of 806205800 is about 28393.7633997327. The cubic root of 806205800 is about 930.7119841709.
The spelling of 806205800 in words is "eight hundred six million, two hundred five thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •