Base | Representation |
---|---|
bin | 110011110110001110… |
… | …1000101110101000111 |
3 | 101122101120011121000021 |
4 | 1213230131011311013 |
5 | 3311011323401211 |
6 | 123052141000011 |
7 | 11021065565113 |
oct | 1475435056507 |
9 | 348346147007 |
10 | 111341231431 |
11 | 4324624a141 |
12 | 196b3b53007 |
13 | a665340081 |
14 | 5563398743 |
15 | 2d69c2e771 |
hex | 19ec745d47 |
111341231431 has 4 divisors (see below), whose sum is σ = 114056871264. Its totient is φ = 108625591600.
The previous prime is 111341231317. The next prime is 111341231539. The reversal of 111341231431 is 134132143111.
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 111341231431 - 29 = 111341230919 is a prime.
It is a super-2 number, since 2×1113412314312 (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 = 111341231396 and 111341231405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111341201431) 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, 1357819855 + ... + 1357819936.
It is an arithmetic number, because the mean of its divisors is an integer number (28514217816).
Almost surely, 2111341231431 is an apocalyptic number.
111341231431 is a deficient number, since it is larger than the sum of its proper divisors (2715639833).
111341231431 is an equidigital number, since it uses as much as digits as its factorization.
111341231431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2715639832.
The product of its digits is 864, while the sum is 25.
Adding to 111341231431 its reverse (134132143111), we get a palindrome (245473374542).
The spelling of 111341231431 in words is "one hundred eleven billion, three hundred forty-one million, two hundred thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •