Base | Representation |
---|---|
bin | 10011001101011110100… |
… | …011011111110001001101 |
3 | 11200012111220210200122201 |
4 | 103031132203133301031 |
5 | 133112122134321331 |
6 | 2450244202041501 |
7 | 164243222046601 |
oct | 23153643376115 |
9 | 4605456720581 |
10 | 1320141323341 |
11 | 4699613a7565 |
12 | 193a287a9291 |
13 | 97647b53849 |
14 | 47c7653b501 |
15 | 245172a9a61 |
hex | 1335e8dfc4d |
1320141323341 has 8 divisors (see below), whose sum is σ = 1338247376000. Its totient is φ = 1302035863392.
The previous prime is 1320141323327. The next prime is 1320141323393. The reversal of 1320141323341 is 1433231410231.
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 1320141323341 - 25 = 1320141323309 is a prime.
It is a super-2 number, since 2×13201413233412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1320141323311) 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, 6172786 + ... + 6383068.
It is an arithmetic number, because the mean of its divisors is an integer number (167280922000).
Almost surely, 21320141323341 is an apocalyptic number.
It is an amenable number.
1320141323341 is a deficient number, since it is larger than the sum of its proper divisors (18106052659).
1320141323341 is an equidigital number, since it uses as much as digits as its factorization.
1320141323341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296355.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 1320141323341 its reverse (1433231410231), we get a palindrome (2753372733572).
The spelling of 1320141323341 in words is "one trillion, three hundred twenty billion, one hundred forty-one million, three hundred twenty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •