Base | Representation |
---|---|
bin | 110100010111111000… |
… | …0001100010011001101 |
3 | 101202022020201211120100 |
4 | 1220233300030103031 |
5 | 3320314344442031 |
6 | 123400153041313 |
7 | 11061055610445 |
oct | 1505760142315 |
9 | 352266654510 |
10 | 112470312141 |
11 | 437756171a0 |
12 | 1996a0b6239 |
13 | a7b5233475 |
14 | 562d307125 |
15 | 2dd3e0bde6 |
hex | 1a2fc0c4cd |
112470312141 has 24 divisors (see below), whose sum is σ = 178287205824. Its totient is φ = 67755648960.
The previous prime is 112470312127. The next prime is 112470312181. The reversal of 112470312141 is 141213074211.
It is a happy number.
It is not a de Polignac number, because 112470312141 - 26 = 112470312077 is a prime.
It is a super-2 number, since 2×1124703121412 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112470312181) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3384856 + ... + 3417921.
It is an arithmetic number, because the mean of its divisors is an integer number (7428633576).
Almost surely, 2112470312141 is an apocalyptic number.
112470312141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112470312141 is a deficient number, since it is larger than the sum of its proper divisors (65816893683).
112470312141 is a wasteful number, since it uses less digits than its factorization.
112470312141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6802961 (or 6802958 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 27.
Adding to 112470312141 its reverse (141213074211), we get a palindrome (253683386352).
The spelling of 112470312141 in words is "one hundred twelve billion, four hundred seventy million, three hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •