Base | Representation |
---|---|
bin | 10010110000010101100001… |
… | …10100000101011100100000 |
3 | 12102000211000110212122212001 |
4 | 21120022300310011130200 |
5 | 20401212130024420000 |
6 | 223414514540013344 |
7 | 11454503665205065 |
oct | 1130126064053440 |
9 | 172024013778761 |
10 | 41243242420000 |
11 | 12161185156355 |
12 | 4761272531254 |
13 | 1a022b490672a |
14 | a2827da7cc6c |
15 | 4b7c70dbb46a |
hex | 2582b0d05720 |
41243242420000 has 60 divisors (see below), whose sum is σ = 101464562888766. Its totient is φ = 16497296960000.
The previous prime is 41243242419997. The next prime is 41243242420019. The reversal of 41243242420000 is 2424234214.
It can be written as a sum of positive squares in 5 ways, for example, as 7663396304656 + 33579846115344 = 2768284^2 + 5794812^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 1031061061 + ... + 1031101060.
Almost surely, 241243242420000 is an apocalyptic number.
41243242420000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41243242420000 is an abundant number, since it is smaller than the sum of its proper divisors (60221320468766).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41243242420000 is an equidigital number, since it uses as much as digits as its factorization.
41243242420000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2062162151 (or 2062162128 counting only the distinct ones).
The product of its (nonzero) digits is 12288, while the sum is 28.
Adding to 41243242420000 its reverse (2424234214), we get a palindrome (41245666654214).
The spelling of 41243242420000 in words is "forty-one trillion, two hundred forty-three billion, two hundred forty-two million, four hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •