Base | Representation |
---|---|
bin | 100110110101101110… |
… | …001010110001000001 |
3 | 10222122101110111220022 |
4 | 212311232022301001 |
5 | 1140402043000411 |
6 | 31054110223225 |
7 | 3004310524601 |
oct | 466556126101 |
9 | 128571414808 |
10 | 41703484481 |
11 | 1676059115a |
12 | 80ba4b4b15 |
13 | 3c17c7bb49 |
14 | 203891cc01 |
15 | 1141327edb |
hex | 9b5b8ac41 |
41703484481 has 8 divisors (see below), whose sum is σ = 43146592680. Its totient is φ = 40260713472.
The previous prime is 41703484451. The next prime is 41703484549. The reversal of 41703484481 is 18448430714.
It can be written as a sum of positive squares in 4 ways, for example, as 7620417025 + 34083067456 = 87295^2 + 184616^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 41703484481 - 210 = 41703483457 is a prime.
It is a super-2 number, since 2×417034844812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41703484451) 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, 181601 + ... + 341153.
It is an arithmetic number, because the mean of its divisors is an integer number (5393324085).
Almost surely, 241703484481 is an apocalyptic number.
It is an amenable number.
41703484481 is a deficient number, since it is larger than the sum of its proper divisors (1443108199).
41703484481 is a wasteful number, since it uses less digits than its factorization.
41703484481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168595.
The product of its (nonzero) digits is 344064, while the sum is 44.
The spelling of 41703484481 in words is "forty-one billion, seven hundred three million, four hundred eighty-four thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •