Base | Representation |
---|---|
bin | 110100011011110001… |
… | …1101101000011100001 |
3 | 101202122101010110222212 |
4 | 1220313203231003201 |
5 | 3321101410144121 |
6 | 123421151411505 |
7 | 11064235612442 |
oct | 1506743550341 |
9 | 352571113885 |
10 | 112601256161 |
11 | 43832523399 |
12 | 199a5b23b95 |
13 | a8063bc834 |
14 | 56428712c9 |
15 | 2de067525b |
hex | 1a378ed0e1 |
112601256161 has 4 divisors (see below), whose sum is σ = 112714881024. Its totient is φ = 112487631300.
The previous prime is 112601256139. The next prime is 112601256169. The reversal of 112601256161 is 161652106211.
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, and also an emirpimes, since its reverse is a distinct semiprime: 161652106211 = 29 ⋅5574210559.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112601256161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112601256169) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 56810945 + ... + 56812926.
It is an arithmetic number, because the mean of its divisors is an integer number (28178720256).
Almost surely, 2112601256161 is an apocalyptic number.
It is an amenable number.
112601256161 is a deficient number, since it is larger than the sum of its proper divisors (113624863).
112601256161 is an equidigital number, since it uses as much as digits as its factorization.
112601256161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113624862.
The product of its (nonzero) digits is 4320, while the sum is 32.
The spelling of 112601256161 in words is "one hundred twelve billion, six hundred one million, two hundred fifty-six thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •