Base | Representation |
---|---|
bin | 110100011001111101… |
… | …0101001000101010001 |
3 | 101202111010011111021120 |
4 | 1220303322221011101 |
5 | 3320440240112322 |
6 | 123411130112453 |
7 | 11062564402503 |
oct | 1506372510521 |
9 | 352433144246 |
10 | 112540160337 |
11 | 43800a94180 |
12 | 1998957b729 |
13 | a7c684ab67 |
14 | 56386c9d73 |
15 | 2dda107a5c |
hex | 1a33ea9151 |
112540160337 has 8 divisors (see below), whose sum is σ = 163694778720. Its totient is φ = 68206157760.
The previous prime is 112540160329. The next prime is 112540160371. The reversal of 112540160337 is 733061045211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112540160337 - 23 = 112540160329 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 3410307889 = 112540160337 / (1 + 1 + 2 + 5 + 4 + 0 + 1 + 6 + 0 + 3 + 3 + 7).
It is a junction number, because it is equal to n+sod(n) for n = 112540160298 and 112540160307.
It is not an unprimeable number, because it can be changed into a prime (112540160377) 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, 1705153912 + ... + 1705153977.
It is an arithmetic number, because the mean of its divisors is an integer number (20461847340).
Almost surely, 2112540160337 is an apocalyptic number.
It is an amenable number.
112540160337 is a deficient number, since it is larger than the sum of its proper divisors (51154618383).
112540160337 is a wasteful number, since it uses less digits than its factorization.
112540160337 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3410307903.
The product of its (nonzero) digits is 15120, while the sum is 33.
The spelling of 112540160337 in words is "one hundred twelve billion, five hundred forty million, one hundred sixty thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •