Base | Representation |
---|---|
bin | 10010110000010101100001… |
… | …10100000111111000111011 |
3 | 12102000211000110220011120211 |
4 | 21120022300310013320323 |
5 | 20401212130030230021 |
6 | 223414514540131551 |
7 | 11454503665246216 |
oct | 1130126064077073 |
9 | 172024013804524 |
10 | 41243242430011 |
11 | 12161185162926 |
12 | 4761272536bb7 |
13 | 1a022b490b15b |
14 | a2827da8277d |
15 | 4b7c70dbe3e1 |
hex | 2582b0d07e3b |
41243242430011 has 8 divisors (see below), whose sum is σ = 41491310170464. Its totient is φ = 40995187811520.
The previous prime is 41243242430003. The next prime is 41243242430107. The reversal of 41243242430011 is 11003424234214.
It is a happy number.
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 41243242430011 - 23 = 41243242430003 is a prime.
It is a super-2 number, since 2×412432424300112 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (41243242430711) 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, 3061311 + ... + 9584263.
It is an arithmetic number, because the mean of its divisors is an integer number (5186413771308).
Almost surely, 241243242430011 is an apocalyptic number.
41243242430011 is a deficient number, since it is larger than the sum of its proper divisors (248067740453).
41243242430011 is a wasteful number, since it uses less digits than its factorization.
41243242430011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6560981.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 41243242430011 its reverse (11003424234214), we get a palindrome (52246666664225).
The spelling of 41243242430011 in words is "forty-one trillion, two hundred forty-three billion, two hundred forty-two million, four hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •