Base | Representation |
---|---|
bin | 110100010011011100… |
… | …0111101101100000001 |
3 | 101201220212221022200121 |
4 | 1220212320331230001 |
5 | 3320013313213031 |
6 | 123333322020241 |
7 | 11054301663043 |
oct | 1504670755401 |
9 | 351825838617 |
10 | 112321616641 |
11 | 436a9696053 |
12 | 19928347681 |
13 | a7904a0270 |
14 | 561767ba93 |
15 | 2dc5d39011 |
hex | 1a26e3db01 |
112321616641 has 8 divisors (see below), whose sum is σ = 120973000064. Its totient is φ = 103671841680.
The previous prime is 112321616621. The next prime is 112321616663. The reversal of 112321616641 is 146616123211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112321616641 - 219 = 112321092353 is a prime.
It is a super-2 number, since 2×1123216166412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112321616597 and 112321616606.
It is not an unprimeable number, because it can be changed into a prime (112321616621) 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, 255081 + ... + 538246.
It is an arithmetic number, because the mean of its divisors is an integer number (15121625008).
Almost surely, 2112321616641 is an apocalyptic number.
It is an amenable number.
112321616641 is a deficient number, since it is larger than the sum of its proper divisors (8651383423).
112321616641 is a wasteful number, since it uses less digits than its factorization.
112321616641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 804231.
The product of its digits is 10368, while the sum is 34.
Adding to 112321616641 its reverse (146616123211), we get a palindrome (258937739852).
The spelling of 112321616641 in words is "one hundred twelve billion, three hundred twenty-one million, six hundred sixteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •