Base | Representation |
---|---|
bin | 10011001101010110010110… |
… | …11110010010100110100001 |
3 | 12112120010010201212121210011 |
4 | 21212223023132102212201 |
5 | 21014030232224313400 |
6 | 225500502203204521 |
7 | 11616514413543433 |
oct | 1146531336224641 |
9 | 175503121777704 |
10 | 42240122104225 |
11 | 12505a31803881 |
12 | 48a2503516741 |
13 | 1a752c35b3176 |
14 | a6060b920653 |
15 | 4d3b687248ba |
hex | 266acb7929a1 |
42240122104225 has 48 divisors (see below), whose sum is σ = 55504438936960. Its totient is φ = 31798785600000.
The previous prime is 42240122104189. The next prime is 42240122104249. The reversal of 42240122104225 is 52240122104224.
42240122104225 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42240122104225 - 211 = 42240122102177 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1243766245 + ... + 1243800205.
Almost surely, 242240122104225 is an apocalyptic number.
It is an amenable number.
42240122104225 is a deficient number, since it is larger than the sum of its proper divisors (13264316832735).
42240122104225 is a wasteful number, since it uses less digits than its factorization.
42240122104225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51482 (or 51477 counting only the distinct ones).
The product of its (nonzero) digits is 20480, while the sum is 31.
Adding to 42240122104225 its reverse (52240122104224), we get a palindrome (94480244208449).
Subtracting 42240122104225 from its reverse (52240122104224), we obtain a palindrome (9999999999999).
The spelling of 42240122104225 in words is "forty-two trillion, two hundred forty billion, one hundred twenty-two million, one hundred four thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •