Base | Representation |
---|---|
bin | 110100011010010000… |
… | …1110010011011101011 |
3 | 101202111211110211222110 |
4 | 1220310201302123223 |
5 | 3321000402003001 |
6 | 123412134053403 |
7 | 11063050542561 |
oct | 1506441623353 |
9 | 352454424873 |
10 | 112550422251 |
11 | 438068630a3 |
12 | 19990aaa263 |
13 | a7c8a019b7 |
14 | 5639bdba31 |
15 | 2ddae833d6 |
hex | 1a348726eb |
112550422251 has 8 divisors (see below), whose sum is σ = 150093855184. Its totient is φ = 75020302080.
The previous prime is 112550422249. The next prime is 112550422253. The reversal of 112550422251 is 152224055211.
It is an interprime number because it is at equal distance from previous prime (112550422249) and next prime (112550422253).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112550422251 - 21 = 112550422249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112550422253) 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 7 ways as a sum of consecutive naturals, for example, 3308446 + ... + 3342291.
It is an arithmetic number, because the mean of its divisors is an integer number (18761731898).
Almost surely, 2112550422251 is an apocalyptic number.
112550422251 is a deficient number, since it is larger than the sum of its proper divisors (37543432933).
112550422251 is an equidigital number, since it uses as much as digits as its factorization.
112550422251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6656381.
The product of its (nonzero) digits is 8000, while the sum is 30.
Adding to 112550422251 its reverse (152224055211), we get a palindrome (264774477462).
The spelling of 112550422251 in words is "one hundred twelve billion, five hundred fifty million, four hundred twenty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •