Base | Representation |
---|---|
bin | 110100001101100000… |
… | …1100110100000111111 |
3 | 101201102000100220200011 |
4 | 1220123001212200333 |
5 | 3314111333220211 |
6 | 123301451244051 |
7 | 11046333662536 |
oct | 1503301464077 |
9 | 351360326604 |
10 | 112122554431 |
11 | 43607293728 |
12 | 19891749627 |
13 | a75b183a84 |
14 | 55d906131d |
15 | 2db3617921 |
hex | 1a1b06683f |
112122554431 has 8 divisors (see below), whose sum is σ = 113534208144. Its totient is φ = 110716120320.
The previous prime is 112122554417. The next prime is 112122554437. The reversal of 112122554431 is 134455221211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112122554431 - 215 = 112122521663 is a prime.
It is a super-2 number, since 2×1121225544312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112122554393 and 112122554402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112122554437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1261660 + ... + 1347601.
It is an arithmetic number, because the mean of its divisors is an integer number (14191776018).
Almost surely, 2112122554431 is an apocalyptic number.
112122554431 is a deficient number, since it is larger than the sum of its proper divisors (1411653713).
112122554431 is an equidigital number, since it uses as much as digits as its factorization.
112122554431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2609801.
The product of its digits is 9600, while the sum is 31.
Adding to 112122554431 its reverse (134455221211), we get a palindrome (246577775642).
The spelling of 112122554431 in words is "one hundred twelve billion, one hundred twenty-two million, five hundred fifty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •