Base | Representation |
---|---|
bin | 100110001001000110000… |
… | …0100100111101010111001 |
3 | 200120011001122012012102012 |
4 | 1030102030010213222321 |
5 | 1141342021242404200 |
6 | 15052123232015305 |
7 | 1050510565555433 |
oct | 114221404475271 |
9 | 20504048165365 |
10 | 5242210122425 |
11 | 1741232a4a461 |
12 | 707b85691535 |
13 | 2c04522cc833 |
14 | 141a1d789653 |
15 | 915666e8a35 |
hex | 4c48c127ab9 |
5242210122425 has 12 divisors (see below), whose sum is σ = 6539264751936. Its totient is φ = 4168655710800.
The previous prime is 5242210122341. The next prime is 5242210122449.
5242210122425 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5242210122425 - 28 = 5242210122169 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5242210122391 and 5242210122400.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 627805421 + ... + 627813770.
It is an arithmetic number, because the mean of its divisors is an integer number (544938729328).
Almost surely, 25242210122425 is an apocalyptic number.
It is an amenable number.
5242210122425 is a deficient number, since it is larger than the sum of its proper divisors (1297054629511).
5242210122425 is a wasteful number, since it uses less digits than its factorization.
5242210122425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1255619368 (or 1255619363 counting only the distinct ones).
The product of its (nonzero) digits is 25600, while the sum is 32.
It can be divided in two parts, 5242210 and 122425, that added together give a palindrome (5364635).
The spelling of 5242210122425 in words is "five trillion, two hundred forty-two billion, two hundred ten million, one hundred twenty-two thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •