Base | Representation |
---|---|
bin | 10010111110001101100100… |
… | …11100110100011101100101 |
3 | 12110201101122022112102120222 |
4 | 21133012302130310131211 |
5 | 20432020040334323123 |
6 | 224421524130334125 |
7 | 11534112525310454 |
oct | 1137066234643545 |
9 | 173641568472528 |
10 | 41720011245413 |
11 | 123253a2789506 |
12 | 481974b42a345 |
13 | 1a38245b14547 |
14 | a4338b7d8b9b |
15 | 4c53772786c8 |
hex | 25f1b2734765 |
41720011245413 has 8 divisors (see below), whose sum is σ = 41749889352600. Its totient is φ = 41690134096128.
The previous prime is 41720011245391. The next prime is 41720011245443. The reversal of 41720011245413 is 31454211002714.
It can be written as a sum of positive squares in 4 ways, for example, as 21168676489249 + 20551334756164 = 4600943^2 + 4533358^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 41720011245413 - 210 = 41720011244389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41720011245443) 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, 102675233 + ... + 103080761.
It is an arithmetic number, because the mean of its divisors is an integer number (5218736169075).
Almost surely, 241720011245413 is an apocalyptic number.
It is an amenable number.
41720011245413 is a deficient number, since it is larger than the sum of its proper divisors (29878107187).
41720011245413 is a wasteful number, since it uses less digits than its factorization.
41720011245413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 478951.
The product of its (nonzero) digits is 26880, while the sum is 35.
The spelling of 41720011245413 in words is "forty-one trillion, seven hundred twenty billion, eleven million, two hundred forty-five thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •