Base | Representation |
---|---|
bin | 10010111001100100010100… |
… | …10011111100111010101001 |
3 | 12110011010201102001112021012 |
4 | 21130302022103330322221 |
5 | 20421411222023322103 |
6 | 224220332322553305 |
7 | 11516433023414342 |
oct | 1134621223747251 |
9 | 173133642045235 |
10 | 41560424042153 |
11 | 12273749991685 |
12 | 47b2831b08835 |
13 | 1a26192249a63 |
14 | a3976ca5b0c9 |
15 | 4c1136b7b2d8 |
hex | 25cc8a4fcea9 |
41560424042153 has 8 divisors (see below), whose sum is σ = 44213710108320. Its totient is φ = 38930310780480.
The previous prime is 41560424042149. The next prime is 41560424042167. The reversal of 41560424042153 is 35124042406514.
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 41560424042153 - 22 = 41560424042149 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 41560424042153.
It is not an unprimeable number, because it can be changed into a prime (41560424042453) 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, 5793197423 + ... + 5793204596.
It is an arithmetic number, because the mean of its divisors is an integer number (5526713763540).
Almost surely, 241560424042153 is an apocalyptic number.
It is an amenable number.
41560424042153 is a deficient number, since it is larger than the sum of its proper divisors (2653286066167).
41560424042153 is a wasteful number, since it uses less digits than its factorization.
41560424042153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11586402247.
The product of its (nonzero) digits is 460800, while the sum is 41.
Adding to 41560424042153 its reverse (35124042406514), we get a palindrome (76684466448667).
The spelling of 41560424042153 in words is "forty-one trillion, five hundred sixty billion, four hundred twenty-four million, forty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •