Base | Representation |
---|---|
bin | 10010110010100101000110… |
… | …00001010010100111000101 |
3 | 12102022011222011201100120020 |
4 | 21121102203001102213011 |
5 | 20403443004011141401 |
6 | 223514143152525353 |
7 | 11463203026265163 |
oct | 1131224301224705 |
9 | 172264864640506 |
10 | 41320320412101 |
11 | 12190938721675 |
12 | 47741a3850859 |
13 | 1a09649563493 |
14 | a2bcb2714233 |
15 | 4b9c82a9ed36 |
hex | 2594a30529c5 |
41320320412101 has 8 divisors (see below), whose sum is σ = 55165033205280. Its totient is φ = 27511243946832.
The previous prime is 41320320412079. The next prime is 41320320412121. The reversal of 41320320412101 is 10121402302314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41320320412101 - 27 = 41320320411973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41320320412121) 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 7 ways as a sum of consecutive naturals, for example, 8909079271 + ... + 8909083908.
It is an arithmetic number, because the mean of its divisors is an integer number (6895629150660).
Almost surely, 241320320412101 is an apocalyptic number.
It is an amenable number.
41320320412101 is a deficient number, since it is larger than the sum of its proper divisors (13844712793179).
41320320412101 is a wasteful number, since it uses less digits than its factorization.
41320320412101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17818163955.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 41320320412101 its reverse (10121402302314), we get a palindrome (51441722714415).
The spelling of 41320320412101 in words is "forty-one trillion, three hundred twenty billion, three hundred twenty million, four hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •