Base | Representation |
---|---|
bin | 110000000000000… |
… | …000000000000000 |
3 | 2002010022210122210 |
4 | 300000000000000 |
5 | 3122124300433 |
6 | 211524302120 |
7 | 25645663656 |
oct | 6000000000 |
9 | 2063283583 |
10 | 805306368 |
11 | 383635659 |
12 | 1a5841940 |
13 | caac0259 |
14 | 78d4add6 |
15 | 4aa74463 |
hex | 30000000 |
805306368 has 58 divisors (see below), whose sum is σ = 2147483644. Its totient is φ = 268435456.
The previous prime is 805306357. The next prime is 805306457. The reversal of 805306368 is 863603508.
It is a Jordan-Polya number, since it can be written as 4! ⋅ (2!)25.
It is a nialpdrome in base 2, base 4, base 8 and base 16.
It is a zygodrome in base 2.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (2) of ones.
In principle, a polygon with 805306368 sides can be constructed with ruler and compass.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 268435455 + 268435456 + 268435457.
Almost surely, 2805306368 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 805306368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1073741822).
805306368 is an abundant number, since it is smaller than the sum of its proper divisors (1342177276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
805306368 is an frugal number, since it uses more digits than its factorization.
805306368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59 (or 5 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 39.
The square root of 805306368 is about 28377.9204312085. The cubic root of 805306368 is about 930.3657435301.
The spelling of 805306368 in words is "eight hundred five million, three hundred six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •