Base | Representation |
---|---|
bin | 10101000100100010… |
… | …01010110001001111 |
3 | 1002012101011121212000 |
4 | 22202101022301033 |
5 | 141131430003033 |
6 | 5110302443343 |
7 | 550221224112 |
oct | 124221126117 |
9 | 32171147760 |
10 | 11312344143 |
11 | 4885583651 |
12 | 2238593553 |
13 | 10b3857c79 |
14 | 794578579 |
15 | 4631daa13 |
hex | 2a244ac4f |
11312344143 has 8 divisors (see below), whose sum is σ = 16759028400. Its totient is φ = 7541562744.
The previous prime is 11312344139. The next prime is 11312344151. The reversal of 11312344143 is 34144321311.
11312344143 is a `hidden beast` number, since 1 + 1 + 312 + 344 + 1 + 4 + 3 = 666.
It is not a de Polignac number, because 11312344143 - 22 = 11312344139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 418975709 = 11312344143 / (1 + 1 + 3 + 1 + 2 + 3 + 4 + 4 + 1 + 4 + 3).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11312344123) 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, 209487828 + ... + 209487881.
It is an arithmetic number, because the mean of its divisors is an integer number (2094878550).
Almost surely, 211312344143 is an apocalyptic number.
11312344143 is a deficient number, since it is larger than the sum of its proper divisors (5446684257).
11312344143 is an equidigital number, since it uses as much as digits as its factorization.
11312344143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418975718 (or 418975712 counting only the distinct ones).
The product of its digits is 3456, while the sum is 27.
Adding to 11312344143 its reverse (34144321311), we get a palindrome (45456665454).
The spelling of 11312344143 in words is "eleven billion, three hundred twelve million, three hundred forty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •