Base | Representation |
---|---|
bin | 110100001101110111… |
… | …0100001111110101011 |
3 | 101201102211112021220200 |
4 | 1220123232201332223 |
5 | 3314122342113311 |
6 | 123302551523243 |
7 | 11046536045460 |
oct | 1503356417653 |
9 | 351384467820 |
10 | 112134332331 |
11 | 436129a862a |
12 | 19895689523 |
13 | a760748948 |
14 | 55da849667 |
15 | 2db4692556 |
hex | 1a1bba1fab |
112134332331 has 12 divisors (see below), whose sum is σ = 185110643952. Its totient is φ = 64076761296.
The previous prime is 112134332311. The next prime is 112134332333. The reversal of 112134332331 is 133233431211.
112134332331 is a `hidden beast` number, since 11 + 213 + 433 + 2 + 3 + 3 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-112134332331 is a prime.
It is a super-2 number, since 2×1121343323312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112134332295 and 112134332304.
It is not an unprimeable number, because it can be changed into a prime (112134332333) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 889954956 + ... + 889955081.
It is an arithmetic number, because the mean of its divisors is an integer number (15425886996).
Almost surely, 2112134332331 is an apocalyptic number.
112134332331 is a deficient number, since it is larger than the sum of its proper divisors (72976311621).
112134332331 is a wasteful number, since it uses less digits than its factorization.
112134332331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1779910050 (or 1779910047 counting only the distinct ones).
The product of its digits is 3888, while the sum is 27.
Adding to 112134332331 its reverse (133233431211), we get a palindrome (245367763542).
The spelling of 112134332331 in words is "one hundred twelve billion, one hundred thirty-four million, three hundred thirty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •