Base | Representation |
---|---|
bin | 10010101001111101110010… |
… | …10001110111010110110001 |
3 | 12101020212222212110001112010 |
4 | 21110332321101313112301 |
5 | 20334120322311042431 |
6 | 223130153325153133 |
7 | 11432624262612414 |
oct | 1124767121672661 |
9 | 171225885401463 |
10 | 41024341112241 |
11 | 12087364067953 |
12 | 47269609bb7a9 |
13 | 19b776a7232a6 |
14 | a1b835593b7b |
15 | 4b220d3a4846 |
hex | 254fb94775b1 |
41024341112241 has 8 divisors (see below), whose sum is σ = 55358147043360. Its totient is φ = 27020047961312.
The previous prime is 41024341112207. The next prime is 41024341112341. The reversal of 41024341112241 is 14221114342014.
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 41024341112241 - 215 = 41024341079473 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 41024341112199 and 41024341112208.
It is not an unprimeable number, because it can be changed into a prime (41024341112341) 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, 82378194756 + ... + 82378195253.
It is an arithmetic number, because the mean of its divisors is an integer number (6919768380420).
Almost surely, 241024341112241 is an apocalyptic number.
It is an amenable number.
41024341112241 is a deficient number, since it is larger than the sum of its proper divisors (14333805931119).
41024341112241 is a wasteful number, since it uses less digits than its factorization.
41024341112241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164756390095.
The product of its (nonzero) digits is 6144, while the sum is 30.
Adding to 41024341112241 its reverse (14221114342014), we get a palindrome (55245455454255).
The spelling of 41024341112241 in words is "forty-one trillion, twenty-four billion, three hundred forty-one million, one hundred twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •