Base | Representation |
---|---|
bin | 110100010000011101… |
… | …0110001001001010001 |
3 | 101201122220102010022122 |
4 | 1220200322301021101 |
5 | 3314312141120012 |
6 | 123315342344025 |
7 | 11051644245563 |
oct | 1504072611121 |
9 | 351586363278 |
10 | 112221426257 |
11 | 43658084586 |
12 | 198ba88b015 |
13 | a7757c0c05 |
14 | 560823b333 |
15 | 2dbc147e72 |
hex | 1a20eb1251 |
112221426257 has 4 divisors (see below), whose sum is σ = 113641950720. Its totient is φ = 110800901796.
The previous prime is 112221426223. The next prime is 112221426259. The reversal of 112221426257 is 752624122211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 112221426257 - 210 = 112221425233 is a prime.
It is a super-2 number, since 2×1122214262572 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112221426259) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 710262113 + ... + 710262270.
It is an arithmetic number, because the mean of its divisors is an integer number (28410487680).
Almost surely, 2112221426257 is an apocalyptic number.
It is an amenable number.
112221426257 is a deficient number, since it is larger than the sum of its proper divisors (1420524463).
112221426257 is an equidigital number, since it uses as much as digits as its factorization.
112221426257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1420524462.
The product of its digits is 26880, while the sum is 35.
Adding to 112221426257 its reverse (752624122211), we get a palindrome (864845548468).
The spelling of 112221426257 in words is "one hundred twelve billion, two hundred twenty-one million, four hundred twenty-six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •