Base | Representation |
---|---|
bin | 1001101000111… |
… | …11011001001101 |
3 | 12122011120022222 |
4 | 10310133121031 |
5 | 131200301231 |
6 | 12005145125 |
7 | 2001242336 |
oct | 464373115 |
9 | 178146288 |
10 | 80868941 |
11 | 4171503a |
12 | 230bb1a5 |
13 | 139a5a5a |
14 | aa5128d |
15 | 717627b |
hex | 4d1f64d |
80868941 has 8 divisors (see below), whose sum is σ = 81502200. Its totient is φ = 80238592.
The previous prime is 80868923. The next prime is 80868947. The reversal of 80868941 is 14986808.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 48841 + 80820100 = 221^2 + 8990^2 .
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 80868941 - 226 = 13760077 is a prime.
It is a super-2 number, since 2×808689412 = 13079571236922962, 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 = 80868892 and 80868901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80868947) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 104231 + ... + 105003.
It is an arithmetic number, because the mean of its divisors is an integer number (10187775).
Almost surely, 280868941 is an apocalyptic number.
It is an amenable number.
80868941 is a deficient number, since it is larger than the sum of its proper divisors (633259).
80868941 is a wasteful number, since it uses less digits than its factorization.
80868941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1455.
The product of its (nonzero) digits is 110592, while the sum is 44.
The square root of 80868941 is about 8992.7159968499. The cubic root of 80868941 is about 432.4413873594.
The spelling of 80868941 in words is "eighty million, eight hundred sixty-eight thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •