Base | Representation |
---|---|
bin | 110100010001000110… |
… | …1111010111101101111 |
3 | 101201201102102120210102 |
4 | 1220202031322331233 |
5 | 3314333231140211 |
6 | 123321441501315 |
7 | 11052330444242 |
oct | 1504215727557 |
9 | 351642376712 |
10 | 112243224431 |
11 | 436694128a8 |
12 | 1990604183b |
13 | a77a183940 |
14 | 560b0b3259 |
15 | 2dbe001a3b |
hex | 1a2237af6f |
112243224431 has 4 divisors (see below), whose sum is σ = 120877318632. Its totient is φ = 103609130232.
The previous prime is 112243224427. The next prime is 112243224437. The reversal of 112243224431 is 134422342211.
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 112243224431 - 22 = 112243224427 is a prime.
It is a super-2 number, since 2×1122432244312 (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 = 112243224394 and 112243224403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112243224437) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4317047081 + ... + 4317047106.
It is an arithmetic number, because the mean of its divisors is an integer number (30219329658).
Almost surely, 2112243224431 is an apocalyptic number.
112243224431 is a deficient number, since it is larger than the sum of its proper divisors (8634094201).
112243224431 is an equidigital number, since it uses as much as digits as its factorization.
112243224431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8634094200.
The product of its digits is 9216, while the sum is 29.
Adding to 112243224431 its reverse (134422342211), we get a palindrome (246665566642).
The spelling of 112243224431 in words is "one hundred twelve billion, two hundred forty-three million, two hundred twenty-four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •