Base | Representation |
---|---|
bin | 10011100011000101100… |
… | …011110110100010010001 |
3 | 11202102101222022100112201 |
4 | 103203011203312202101 |
5 | 134002132120300241 |
6 | 2505042430323201 |
7 | 166024216126363 |
oct | 23430543664221 |
9 | 4672358270481 |
10 | 1343344306321 |
11 | 478788927056 |
12 | 198423359501 |
13 | 998a4ca2984 |
14 | 49037d86d33 |
15 | 24e24312931 |
hex | 138c58f6891 |
1343344306321 has 8 divisors (see below), whose sum is σ = 1433564282880. Its totient is φ = 1254368743488.
The previous prime is 1343344306313. The next prime is 1343344306333. The reversal of 1343344306321 is 1236034433431.
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 1343344306321 - 23 = 1343344306313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1343344306351) 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 7 ways as a sum of consecutive naturals, for example, 311101201 + ... + 311105518.
It is an arithmetic number, because the mean of its divisors is an integer number (179195535360).
Almost surely, 21343344306321 is an apocalyptic number.
It is an amenable number.
1343344306321 is a deficient number, since it is larger than the sum of its proper divisors (90219976559).
1343344306321 is a wasteful number, since it uses less digits than its factorization.
1343344306321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622206863.
The product of its (nonzero) digits is 186624, while the sum is 37.
Adding to 1343344306321 its reverse (1236034433431), we get a palindrome (2579378739752).
The spelling of 1343344306321 in words is "one trillion, three hundred forty-three billion, three hundred forty-four million, three hundred six thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •