Base | Representation |
---|---|
bin | 1001100110100… |
… | …01100011101001 |
3 | 12121120100222211 |
4 | 10303101203221 |
5 | 131110100441 |
6 | 11554245121 |
7 | 1665444001 |
oct | 463214351 |
9 | 177510884 |
10 | 80550121 |
11 | 41517553 |
12 | 22b867a1 |
13 | 138c38c2 |
14 | a9ab001 |
15 | 7111a81 |
hex | 4cd18e9 |
80550121 has 8 divisors (see below), whose sum is σ = 83295488. Its totient is φ = 77814000.
The previous prime is 80550091. The next prime is 80550181. The reversal of 80550121 is 12105508.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 80550121 - 27 = 80549993 is a prime.
It is a super-2 number, since 2×805501212 = 12976643986229282, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 80550092 and 80550101.
It is not an unprimeable number, because it can be changed into a prime (80550181) 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 7 ways as a sum of consecutive naturals, for example, 18526 + ... + 22456.
It is an arithmetic number, because the mean of its divisors is an integer number (10411936).
Almost surely, 280550121 is an apocalyptic number.
It is an amenable number.
80550121 is a deficient number, since it is larger than the sum of its proper divisors (2745367).
80550121 is a wasteful number, since it uses less digits than its factorization.
80550121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4623.
The product of its (nonzero) digits is 400, while the sum is 22.
The square root of 80550121 is about 8974.9719219617. The cubic root of 80550121 is about 431.8723491872.
Adding to 80550121 its reverse (12105508), we get a palindrome (92655629).
The spelling of 80550121 in words is "eighty million, five hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •