Base | Representation |
---|---|
bin | 10010110101101100001100… |
… | …10100000110110001010000 |
3 | 12102200101212200221210201020 |
4 | 21122312012110012301100 |
5 | 20412220413011044342 |
6 | 224035222055435440 |
7 | 11504005646215464 |
oct | 1132660624066120 |
9 | 172611780853636 |
10 | 41427212987472 |
11 | 122222007a9654 |
12 | 4790a55985b80 |
13 | 1a16753035a90 |
14 | a33132d2a4a4 |
15 | 4bc93be840ec |
hex | 25ad86506c50 |
41427212987472 has 320 divisors, whose sum is σ = 122446456425216. Its totient is φ = 11956357693440.
The previous prime is 41427212987393. The next prime is 41427212987477. The reversal of 41427212987472 is 27478921272414.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41427212987477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4744837347 + ... + 4744846077.
Almost surely, 241427212987472 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41427212987472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61223228212608).
41427212987472 is an abundant number, since it is smaller than the sum of its proper divisors (81019243437744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41427212987472 is a wasteful number, since it uses less digits than its factorization.
41427212987472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10238 (or 10232 counting only the distinct ones).
The product of its digits is 25288704, while the sum is 60.
The spelling of 41427212987472 in words is "forty-one trillion, four hundred twenty-seven billion, two hundred twelve million, nine hundred eighty-seven thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •