Base | Representation |
---|---|
bin | 110100001101110011… |
… | …0110100011111101111 |
3 | 101201102200201121012102 |
4 | 1220123212310133233 |
5 | 3314121332423043 |
6 | 123302440325315 |
7 | 11046512626445 |
oct | 1503346643757 |
9 | 351380647172 |
10 | 112132311023 |
11 | 43611847a27 |
12 | 19894a7383b |
13 | a7601bb8c5 |
14 | 55da480b95 |
15 | 2db43e36b8 |
hex | 1a1b9b47ef |
112132311023 has 4 divisors (see below), whose sum is σ = 113392224720. Its totient is φ = 110872397328.
The previous prime is 112132311019. The next prime is 112132311029. The reversal of 112132311023 is 320113231211.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112132311023 - 22 = 112132311019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112132310986 and 112132311004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112132311029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 629956715 + ... + 629956892.
It is an arithmetic number, because the mean of its divisors is an integer number (28348056180).
Almost surely, 2112132311023 is an apocalyptic number.
112132311023 is a deficient number, since it is larger than the sum of its proper divisors (1259913697).
112132311023 is an equidigital number, since it uses as much as digits as its factorization.
112132311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1259913696.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 112132311023 its reverse (320113231211), we get a palindrome (432245542234).
The spelling of 112132311023 in words is "one hundred twelve billion, one hundred thirty-two million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •