Base | Representation |
---|---|
bin | 10010111010110000001010… |
… | …11011011011001000011001 |
3 | 12110022000211021102011111001 |
4 | 21131120011123123020121 |
5 | 20423043120420213103 |
6 | 224251145111305001 |
7 | 11522404065056350 |
oct | 1135300533331031 |
9 | 173260737364431 |
10 | 41601144304153 |
11 | 12289a45469175 |
12 | 47ba6b707b161 |
13 | 1a29c815b4145 |
14 | a3b712b58997 |
15 | 4c221b9d901d |
hex | 25d6056db219 |
41601144304153 has 4 divisors (see below), whose sum is σ = 47544164919040. Its totient is φ = 35658123689268.
The previous prime is 41601144304141. The next prime is 41601144304169. The reversal of 41601144304153 is 35140344110614.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 41601144304153 - 225 = 41601110749721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41601144305153) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2971510307433 + ... + 2971510307446.
It is an arithmetic number, because the mean of its divisors is an integer number (11886041229760).
Almost surely, 241601144304153 is an apocalyptic number.
It is an amenable number.
41601144304153 is a deficient number, since it is larger than the sum of its proper divisors (5943020614887).
41601144304153 is an equidigital number, since it uses as much as digits as its factorization.
41601144304153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5943020614886.
The product of its (nonzero) digits is 69120, while the sum is 37.
Adding to 41601144304153 its reverse (35140344110614), we get a palindrome (76741488414767).
The spelling of 41601144304153 in words is "forty-one trillion, six hundred one billion, one hundred forty-four million, three hundred four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •