Base | Representation |
---|---|
bin | 110100001101100010… |
… | …1011000010111010101 |
3 | 101201102002020020112120 |
4 | 1220123011120113111 |
5 | 3314112111420140 |
6 | 123301524410153 |
7 | 11046345256611 |
oct | 1503305302725 |
9 | 351362206476 |
10 | 112123545045 |
11 | 436078aaa16 |
12 | 19891b46959 |
13 | a75b43c935 |
14 | 55d923c341 |
15 | 2db37611d0 |
hex | 1a1b1585d5 |
112123545045 has 8 divisors (see below), whose sum is σ = 179397672096. Its totient is φ = 59799224016.
The previous prime is 112123545041. The next prime is 112123545113. The reversal of 112123545045 is 540545321211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112123545045 - 22 = 112123545041 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112123544997 and 112123545015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112123545041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3737451487 + ... + 3737451516.
It is an arithmetic number, because the mean of its divisors is an integer number (22424709012).
Almost surely, 2112123545045 is an apocalyptic number.
112123545045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
112123545045 is a deficient number, since it is larger than the sum of its proper divisors (67274127051).
112123545045 is an equidigital number, since it uses as much as digits as its factorization.
112123545045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7474903011.
The product of its (nonzero) digits is 24000, while the sum is 33.
Adding to 112123545045 its reverse (540545321211), we get a palindrome (652668866256).
The spelling of 112123545045 in words is "one hundred twelve billion, one hundred twenty-three million, five hundred forty-five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •