Base | Representation |
---|---|
bin | 110011111001010011… |
… | …0110100000000000111 |
3 | 101122122202101021212021 |
4 | 1213302212310000013 |
5 | 3311214234140033 |
6 | 123110305104011 |
7 | 11023461064645 |
oct | 1476246640007 |
9 | 348582337767 |
10 | 111444443143 |
11 | 43299534680 |
12 | 19722628007 |
13 | a6808396a7 |
14 | 5572d84195 |
15 | 2d73d1ab2d |
hex | 19f29b4007 |
111444443143 has 8 divisors (see below), whose sum is σ = 128727271440. Its totient is φ = 95353534080.
The previous prime is 111444443137. The next prime is 111444443189. The reversal of 111444443143 is 341344444111.
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 111444443143 - 213 = 111444434951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111444443099 and 111444443108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111444443843) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 297979608 + ... + 297979981.
It is an arithmetic number, because the mean of its divisors is an integer number (16090908930).
Almost surely, 2111444443143 is an apocalyptic number.
111444443143 is a deficient number, since it is larger than the sum of its proper divisors (17282828297).
111444443143 is a wasteful number, since it uses less digits than its factorization.
111444443143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 595959617.
The product of its digits is 36864, while the sum is 34.
Adding to 111444443143 its reverse (341344444111), we get a palindrome (452788887254).
The spelling of 111444443143 in words is "one hundred eleven billion, four hundred forty-four million, four hundred forty-three thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •