Base | Representation |
---|---|
bin | 10000101000110011001… |
… | …100000110100011101111 |
3 | 11001022002221111102210000 |
4 | 100220303030012203233 |
5 | 122213004422030333 |
6 | 2233122313515343 |
7 | 145413352412154 |
oct | 20506314064357 |
9 | 4038087442700 |
10 | 1143320111343 |
11 | 40097443a903 |
12 | 1656bb712b53 |
13 | 83a78961b57 |
14 | 3d4a09a822b |
15 | 1eb18bae713 |
hex | 10a333068ef |
1143320111343 has 10 divisors (see below), whose sum is σ = 1707922635584. Its totient is φ = 762213407508.
The previous prime is 1143320111341. The next prime is 1143320111377. The reversal of 1143320111343 is 3431110233411.
1143320111343 is a `hidden beast` number, since 11 + 433 + 201 + 1 + 13 + 4 + 3 = 666.
It is not a de Polignac number, because 1143320111343 - 21 = 1143320111341 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1143320111341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 7057531471 + ... + 7057531632.
Almost surely, 21143320111343 is an apocalyptic number.
1143320111343 is a deficient number, since it is larger than the sum of its proper divisors (564602524241).
1143320111343 is an equidigital number, since it uses as much as digits as its factorization.
1143320111343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14115063115 (or 14115063106 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 1143320111343 its reverse (3431110233411), we get a palindrome (4574430344754).
The spelling of 1143320111343 in words is "one trillion, one hundred forty-three billion, three hundred twenty million, one hundred eleven thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •