Base | Representation |
---|---|
bin | 110100010111010100… |
… | …0000110100011001101 |
3 | 101202020221011201111101 |
4 | 1220232220012203031 |
5 | 3320300030223341 |
6 | 123354240023101 |
7 | 11060436151456 |
oct | 1505650064315 |
9 | 352227151441 |
10 | 112451414221 |
11 | 43765989983 |
12 | 19963901a91 |
13 | a7b1347873 |
14 | 562a9c812d |
15 | 2dd2427831 |
hex | 1a2ea068cd |
112451414221 has 2 divisors, whose sum is σ = 112451414222. Its totient is φ = 112451414220.
The previous prime is 112451414213. The next prime is 112451414233. The reversal of 112451414221 is 122414154211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 112217630121 + 233784100 = 334989^2 + 15290^2 .
It is a cyclic number.
It is not a de Polignac number, because 112451414221 - 23 = 112451414213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112451414221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112451514221) 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 as a sum of consecutive naturals, namely, 56225707110 + 56225707111.
It is an arithmetic number, because the mean of its divisors is an integer number (56225707111).
Almost surely, 2112451414221 is an apocalyptic number.
It is an amenable number.
112451414221 is a deficient number, since it is larger than the sum of its proper divisors (1).
112451414221 is an equidigital number, since it uses as much as digits as its factorization.
112451414221 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2560, while the sum is 28.
Adding to 112451414221 its reverse (122414154211), we get a palindrome (234865568432).
The spelling of 112451414221 in words is "one hundred twelve billion, four hundred fifty-one million, four hundred fourteen thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •