Base | Representation |
---|---|
bin | 1100011101011… |
… | …01110101111001 |
3 | 21021200012222011 |
4 | 12032231311321 |
5 | 203224133311 |
6 | 14212125521 |
7 | 2406262120 |
oct | 616556571 |
9 | 237605864 |
10 | 104521081 |
11 | 53aaa265 |
12 | 2b0068a1 |
13 | 188675c2 |
14 | dc4aab7 |
15 | 9299321 |
hex | 63add79 |
104521081 has 8 divisors (see below), whose sum is σ = 120549440. Its totient is φ = 88766928.
The previous prime is 104521069. The next prime is 104521099. The reversal of 104521081 is 180125401.
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 104521081 - 27 = 104520953 is a prime.
It is a super-2 number, since 2×1045210812 = 21849312746817122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104521031) 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, 67731 + ... + 69256.
It is an arithmetic number, because the mean of its divisors is an integer number (15068680).
Almost surely, 2104521081 is an apocalyptic number.
It is an amenable number.
104521081 is a deficient number, since it is larger than the sum of its proper divisors (16028359).
104521081 is a wasteful number, since it uses less digits than its factorization.
104521081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137103.
The product of its (nonzero) digits is 320, while the sum is 22.
The square root of 104521081 is about 10223.5552035483. Note that the first 3 decimals coincide. The cubic root of 104521081 is about 471.0510370330.
Adding to 104521081 its reverse (180125401), we get a palindrome (284646482).
The spelling of 104521081 in words is "one hundred four million, five hundred twenty-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •