Base | Representation |
---|---|
bin | 101111101100110… |
… | …011000110100000 |
3 | 2001202212001220100 |
4 | 233230303012200 |
5 | 3114332212200 |
6 | 211224342400 |
7 | 25555130565 |
oct | 5754630640 |
9 | 2052761810 |
10 | 800272800 |
11 | 380807888 |
12 | 1a4014a00 |
13 | c9a4a102 |
14 | 783da86c |
15 | 4a3ccd00 |
hex | 2fb331a0 |
800272800 has 108 divisors (see below), whose sum is σ = 2821987350. Its totient is φ = 213404160.
The previous prime is 800272783. The next prime is 800272801. The reversal of 800272800 is 8272008.
800272800 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 586995984 + 213276816 = 24228^2 + 14604^2 .
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (800272801) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 48375 + ... + 62774.
Almost surely, 2800272800 is an apocalyptic number.
800272800 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
800272800 is an abundant number, since it is smaller than the sum of its proper divisors (2021714550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
800272800 is a wasteful number, since it uses less digits than its factorization.
800272800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111175 (or 111159 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 27.
The square root of 800272800 is about 28289.0933046643. The cubic root of 800272800 is about 928.4232735170.
The spelling of 800272800 in words is "eight hundred million, two hundred seventy-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.996 sec. • engine limits •