Base | Representation |
---|---|
bin | 110000000010101… |
… | …010110110110100 |
3 | 2002011122100122100 |
4 | 300002222312310 |
5 | 3122314144241 |
6 | 211551302100 |
7 | 25654640202 |
oct | 6002526664 |
9 | 2064570570 |
10 | 806006196 |
11 | 383a73426 |
12 | 1a5b1a930 |
13 | caca6958 |
14 | 79090072 |
15 | 4ab619b6 |
hex | 300aadb4 |
806006196 has 36 divisors (see below), whose sum is σ = 2080757952. Its totient is φ = 262951824.
The previous prime is 806006191. The next prime is 806006207. The reversal of 806006196 is 691600608.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 806006196.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (806006191) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 236490 + ... + 239873.
It is an arithmetic number, because the mean of its divisors is an integer number (57798832).
Almost surely, 2806006196 is an apocalyptic number.
It is an amenable number.
806006196 is an abundant number, since it is smaller than the sum of its proper divisors (1274751756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
806006196 is a wasteful number, since it uses less digits than its factorization.
806006196 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476420 (or 476415 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 36.
The square root of 806006196 is about 28390.2482553429. The cubic root of 806006196 is about 930.6351679003.
The spelling of 806006196 in words is "eight hundred six million, six thousand, one hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •