Base | Representation |
---|---|
bin | 110100010110011100… |
… | …0011010000101111110 |
3 | 101202011220002010210000 |
4 | 1220230320122011332 |
5 | 3320220031243032 |
6 | 123351312255130 |
7 | 11056632242013 |
oct | 1505470320576 |
9 | 352156063700 |
10 | 112422134142 |
11 | 4375040036a |
12 | 19955b414a6 |
13 | a7a8265486 |
14 | 5626b6570a |
15 | 2dcea91e7c |
hex | 1a2ce1a17e |
112422134142 has 40 divisors (see below), whose sum is σ = 252413865000. Its totient is φ = 37398919536.
The previous prime is 112422134141. The next prime is 112422134161. The reversal of 112422134142 is 241431224211.
112422134142 is a `hidden beast` number, since 1 + 1 + 24 + 221 + 3 + 414 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112422134141) 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 19 ways as a sum of consecutive naturals, for example, 614517 + ... + 776192.
It is an arithmetic number, because the mean of its divisors is an integer number (6310346625).
Almost surely, 2112422134142 is an apocalyptic number.
112422134142 is an abundant number, since it is smaller than the sum of its proper divisors (139991730858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112422134142 is a wasteful number, since it uses less digits than its factorization.
112422134142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1391222 (or 1391213 counting only the distinct ones).
The product of its digits is 3072, while the sum is 27.
Adding to 112422134142 its reverse (241431224211), we get a palindrome (353853358353).
The spelling of 112422134142 in words is "one hundred twelve billion, four hundred twenty-two million, one hundred thirty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •