Base | Representation |
---|---|
bin | 110011111000010101… |
… | …1100110000000110100 |
3 | 101122120111121020012112 |
4 | 1213300223212000310 |
5 | 3311133002022012 |
6 | 123103152510152 |
7 | 11022616403624 |
oct | 1476053460064 |
9 | 348514536175 |
10 | 111412142132 |
11 | 43282282425 |
12 | 1971384b358 |
13 | a676c3a275 |
14 | 556c976884 |
15 | 2d7108a122 |
hex | 19f0ae6034 |
111412142132 has 6 divisors (see below), whose sum is σ = 194971248738. Its totient is φ = 55706071064.
The previous prime is 111412142129. The next prime is 111412142137. The reversal of 111412142132 is 231241214111.
It can be written as a sum of positive squares in only one way, i.e., 111398407696 + 13734436 = 333764^2 + 3706^2 .
It is a junction number, because it is equal to n+sod(n) for n = 111412142098 and 111412142107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111412142137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13926517763 + ... + 13926517770.
It is an arithmetic number, because the mean of its divisors is an integer number (32495208123).
Almost surely, 2111412142132 is an apocalyptic number.
It is an amenable number.
111412142132 is a deficient number, since it is larger than the sum of its proper divisors (83559106606).
111412142132 is a wasteful number, since it uses less digits than its factorization.
111412142132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27853035537 (or 27853035535 counting only the distinct ones).
The product of its digits is 384, while the sum is 23.
Adding to 111412142132 its reverse (231241214111), we get a palindrome (342653356243).
The spelling of 111412142132 in words is "one hundred eleven billion, four hundred twelve million, one hundred forty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •