Base | Representation |
---|---|
bin | 10011001101100100101… |
… | …001000000011011100111 |
3 | 11200012210000221022020011 |
4 | 103031210221000123213 |
5 | 133112324304244033 |
6 | 2450302250351051 |
7 | 164245602001150 |
oct | 23154451003347 |
9 | 4605700838204 |
10 | 1320243431143 |
11 | 469a03aa867a |
12 | 193a56a2b487 |
13 | 97663054870 |
14 | 47c85d1a927 |
15 | 24521228ccd |
hex | 13364a406e7 |
1320243431143 has 64 divisors (see below), whose sum is σ = 1677580369920. Its totient is φ = 1011278131200.
The previous prime is 1320243431137. The next prime is 1320243431167. The reversal of 1320243431143 is 3411343420231.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1320243431143 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320243431173) 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 63 ways as a sum of consecutive naturals, for example, 147855703 + ... + 147864631.
It is an arithmetic number, because the mean of its divisors is an integer number (26212193280).
Almost surely, 21320243431143 is an apocalyptic number.
1320243431143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1320243431143 is a deficient number, since it is larger than the sum of its proper divisors (357336938777).
1320243431143 is a wasteful number, since it uses less digits than its factorization.
1320243431143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9368.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 1320243431143 its reverse (3411343420231), we get a palindrome (4731586851374).
The spelling of 1320243431143 in words is "one trillion, three hundred twenty billion, two hundred forty-three million, four hundred thirty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •