Base | Representation |
---|---|
bin | 1001100110010… |
… | …11011111110101 |
3 | 12121112002221120 |
4 | 10303023133311 |
5 | 131103302201 |
6 | 11553534153 |
7 | 1665311433 |
oct | 463133765 |
9 | 177462846 |
10 | 80525301 |
11 | 414aa93a |
12 | 22b74359 |
13 | 138b550c |
14 | a9a1d53 |
15 | 7109536 |
hex | 4ccb7f5 |
80525301 has 8 divisors (see below), whose sum is σ = 107672640. Its totient is φ = 53530752.
The previous prime is 80525293. The next prime is 80525303. The reversal of 80525301 is 10352508.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 80525301 - 23 = 80525293 is a prime.
It is a super-2 number, since 2×805253012 = 12968648202281202, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80525303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36961 + ... + 39078.
It is an arithmetic number, because the mean of its divisors is an integer number (13459080).
Almost surely, 280525301 is an apocalyptic number.
It is an amenable number.
80525301 is a deficient number, since it is larger than the sum of its proper divisors (27147339).
80525301 is a wasteful number, since it uses less digits than its factorization.
80525301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76395.
The product of its (nonzero) digits is 1200, while the sum is 24.
The square root of 80525301 is about 8973.5890812985. The cubic root of 80525301 is about 431.8279868584.
Adding to 80525301 its reverse (10352508), we get a palindrome (90877809).
It can be divided in two parts, 805 and 25301, that added together give a triangular number (26106 = T228).
The spelling of 80525301 in words is "eighty million, five hundred twenty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •