Base | Representation |
---|---|
bin | 10010101101101101011100… |
… | …01011111111001110110111 |
3 | 12101201012002121110001102011 |
4 | 21112312232023333032313 |
5 | 20343222323013304033 |
6 | 223305232402225051 |
7 | 11445130542510331 |
oct | 1126665613771667 |
9 | 171635077401364 |
10 | 41153004041143 |
11 | 12126988a19745 |
12 | 4747889955187 |
13 | 19c69335b0497 |
14 | a23b5d24c451 |
15 | 4b573db53ccd |
hex | 256dae2ff3b7 |
41153004041143 has 8 divisors (see below), whose sum is σ = 42573997623600. Its totient is φ = 39732138757248.
The previous prime is 41153004041119. The next prime is 41153004041179. The reversal of 41153004041143 is 34114040035114.
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 41153004041143 - 217 = 41153003910071 is a prime.
It is a super-2 number, since 2×411530040411432 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41153004047143) 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, 31421821 + ... + 32705302.
It is an arithmetic number, because the mean of its divisors is an integer number (5321749702950).
Almost surely, 241153004041143 is an apocalyptic number.
41153004041143 is a deficient number, since it is larger than the sum of its proper divisors (1420993582457).
41153004041143 is a wasteful number, since it uses less digits than its factorization.
41153004041143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64149281.
The product of its (nonzero) digits is 11520, while the sum is 31.
Adding to 41153004041143 its reverse (34114040035114), we get a palindrome (75267044076257).
The spelling of 41153004041143 in words is "forty-one trillion, one hundred fifty-three billion, four million, forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •