Base | Representation |
---|---|
bin | 111001000001000011… |
… | …1101100111000101001 |
3 | 102201001012111020110110 |
4 | 1302002013230320221 |
5 | 4001230142004400 |
6 | 132125452004533 |
7 | 11563142012445 |
oct | 1620207547051 |
9 | 381035436413 |
10 | 122442141225 |
11 | 47a2243aa58 |
12 | 1b891760749 |
13 | b714139351 |
14 | 5cd7815825 |
15 | 32b95a2e50 |
hex | 1c821ece29 |
122442141225 has 12 divisors (see below), whose sum is σ = 202437673616. Its totient is φ = 65302475280.
The previous prime is 122442141223. The next prime is 122442141253. The reversal of 122442141225 is 522141244221.
It is not a de Polignac number, because 122442141225 - 21 = 122442141223 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 122442141192 and 122442141201.
It is not an unprimeable number, because it can be changed into a prime (122442141223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 816280867 + ... + 816281016.
Almost surely, 2122442141225 is an apocalyptic number.
122442141225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
122442141225 is a deficient number, since it is larger than the sum of its proper divisors (79995532391).
122442141225 is a wasteful number, since it uses less digits than its factorization.
122442141225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1632561896 (or 1632561891 counting only the distinct ones).
The product of its digits is 10240, while the sum is 30.
Adding to 122442141225 its reverse (522141244221), we get a palindrome (644583385446).
The spelling of 122442141225 in words is "one hundred twenty-two billion, four hundred forty-two million, one hundred forty-one thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •