Base | Representation |
---|---|
bin | 1011011010100100111101… |
… | …0011110111000011111001 |
3 | 1122102212220110020201210210 |
4 | 2312221033103313003321 |
5 | 3121114402102421431 |
6 | 42405541515501333 |
7 | 2433540025414161 |
oct | 266511723670371 |
9 | 48385813221723 |
10 | 12551225045241 |
11 | 3aa9a43367a33 |
12 | 14a8617a57849 |
13 | 7007633304cc |
14 | 3156a81015a1 |
15 | 16b745c2ed46 |
hex | b6a4f4f70f9 |
12551225045241 has 8 divisors (see below), whose sum is σ = 17312034545280. Its totient is φ = 8078949454352.
The previous prime is 12551225045239. The next prime is 12551225045279. The reversal of 12551225045241 is 14254052215521.
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 12551225045241 - 21 = 12551225045239 is a prime.
It is a super-3 number, since 3×125512250452413 (a number of 40 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12551225045241.
It is not an unprimeable number, because it can be changed into a prime (12551225045221) 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, 72133477185 + ... + 72133477358.
It is an arithmetic number, because the mean of its divisors is an integer number (2164004318160).
Almost surely, 212551225045241 is an apocalyptic number.
It is an amenable number.
12551225045241 is a deficient number, since it is larger than the sum of its proper divisors (4760809500039).
12551225045241 is a wasteful number, since it uses less digits than its factorization.
12551225045241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144266954575.
The product of its (nonzero) digits is 160000, while the sum is 39.
The spelling of 12551225045241 in words is "twelve trillion, five hundred fifty-one billion, two hundred twenty-five million, forty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •