Base | Representation |
---|---|
bin | 1001100100010… |
… | …01101001110000 |
3 | 12121000101222122 |
4 | 10302021221300 |
5 | 131021134400 |
6 | 11544053412 |
7 | 1663106225 |
oct | 462115160 |
9 | 177011878 |
10 | 80255600 |
11 | 41336247 |
12 | 22a64268 |
13 | 1381c829 |
14 | a93194c |
15 | 70a4685 |
hex | 4c89a70 |
80255600 has 30 divisors (see below), whose sum is σ = 192815040. Its totient is φ = 32102080.
The previous prime is 80255599. The next prime is 80255603. The reversal of 80255600 is 655208.
It is a super-2 number, since 2×802556002 = 12881922662720000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 80255600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80255603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 99920 + ... + 100719.
It is an arithmetic number, because the mean of its divisors is an integer number (6427168).
Almost surely, 280255600 is an apocalyptic number.
80255600 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
80255600 is an abundant number, since it is smaller than the sum of its proper divisors (112559440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80255600 is a wasteful number, since it uses less digits than its factorization.
80255600 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200657 (or 200646 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 80255600 is about 8958.5489896523. The cubic root of 80255600 is about 431.3453447383.
The spelling of 80255600 in words is "eighty million, two hundred fifty-five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •