Base | Representation |
---|---|
bin | 1100011100101… |
… | …10110110000001 |
3 | 21021111102202021 |
4 | 12032112312001 |
5 | 203213130011 |
6 | 14210121441 |
7 | 2405420356 |
oct | 616266601 |
9 | 237442667 |
10 | 104426881 |
11 | 53a45509 |
12 | 2ab80281 |
13 | 18833770 |
14 | dc2462d |
15 | 927b471 |
hex | 6396d81 |
104426881 has 8 divisors (see below), whose sum is σ = 112591080. Its totient is φ = 96281472.
The previous prime is 104426867. The next prime is 104426891. The reversal of 104426881 is 188624401.
It can be written as a sum of positive squares in 4 ways, for example, as 80656 + 104346225 = 284^2 + 10215^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 104426881 - 25 = 104426849 is a prime.
It is a super-2 number, since 2×1044268812 = 21809946950776322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104426821) 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, 8175 + ... + 16603.
It is an arithmetic number, because the mean of its divisors is an integer number (14073885).
Almost surely, 2104426881 is an apocalyptic number.
It is an amenable number.
104426881 is a deficient number, since it is larger than the sum of its proper divisors (8164199).
104426881 is an equidigital number, since it uses as much as digits as its factorization.
104426881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9395.
The product of its (nonzero) digits is 12288, while the sum is 34.
The square root of 104426881 is about 10218.9471571195. The cubic root of 104426881 is about 470.9094823521.
The spelling of 104426881 in words is "one hundred four million, four hundred twenty-six thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •