Base | Representation |
---|---|
bin | 10111100011000100… |
… | …00001001001001001 |
3 | 1012122001110022221112 |
4 | 23301202001021021 |
5 | 201342343124400 |
6 | 5450245220105 |
7 | 625166411621 |
oct | 136142011111 |
9 | 35561408845 |
10 | 12642161225 |
11 | 53a8196931 |
12 | 2549a01635 |
13 | 1266202895 |
14 | 87d01b881 |
15 | 4ded1a835 |
hex | 2f1881249 |
12642161225 has 6 divisors (see below), whose sum is σ = 15676279950. Its totient is φ = 10113728960.
The previous prime is 12642161219. The next prime is 12642161227. The reversal of 12642161225 is 52216124621.
It can be written as a sum of positive squares in 3 ways, for example, as 131515024 + 12510646201 = 11468^2 + 111851^2 .
It is not a de Polignac number, because 12642161225 - 232 = 8347193929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12642161191 and 12642161200.
It is not an unprimeable number, because it can be changed into a prime (12642161227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 252843200 + ... + 252843249.
It is an arithmetic number, because the mean of its divisors is an integer number (2612713325).
Almost surely, 212642161225 is an apocalyptic number.
It is an amenable number.
12642161225 is a deficient number, since it is larger than the sum of its proper divisors (3034118725).
12642161225 is an equidigital number, since it uses as much as digits as its factorization.
12642161225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505686459 (or 505686454 counting only the distinct ones).
The product of its digits is 11520, while the sum is 32.
Adding to 12642161225 its reverse (52216124621), we get a palindrome (64858285846).
The spelling of 12642161225 in words is "twelve billion, six hundred forty-two million, one hundred sixty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •