Base | Representation |
---|---|
bin | 100110110100010100… |
… | …111001010111110001 |
3 | 10222120202102120022012 |
4 | 212310110321113301 |
5 | 1140330100114132 |
6 | 31051512452305 |
7 | 3003604566161 |
oct | 466424712761 |
9 | 128522376265 |
10 | 41680082417 |
11 | 16749357906 |
12 | 80b26aa095 |
13 | 3c1317707c |
14 | 203578a5a1 |
15 | 113e2540b2 |
hex | 9b45395f1 |
41680082417 has 4 divisors (see below), whose sum is σ = 41761969140. Its totient is φ = 41598195696.
The previous prime is 41680082407. The next prime is 41680082489. The reversal of 41680082417 is 71428008614.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 71428008614 = 2 ⋅35714004307.
It can be written as a sum of positive squares in 2 ways, for example, as 25932593296 + 15747489121 = 161036^2 + 125489^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-41680082417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41680082407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40942598 + ... + 40943615.
It is an arithmetic number, because the mean of its divisors is an integer number (10440492285).
Almost surely, 241680082417 is an apocalyptic number.
It is an amenable number.
41680082417 is a deficient number, since it is larger than the sum of its proper divisors (81886723).
41680082417 is an equidigital number, since it uses as much as digits as its factorization.
41680082417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81886722.
The product of its (nonzero) digits is 86016, while the sum is 41.
The spelling of 41680082417 in words is "forty-one billion, six hundred eighty million, eighty-two thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •