Base | Representation |
---|---|
bin | 10011100010110001000… |
… | …011111101110001000101 |
3 | 11202101112000012020220011 |
4 | 103202301003331301011 |
5 | 134000431100344023 |
6 | 2504544343310221 |
7 | 166012542034003 |
oct | 23426103756105 |
9 | 4671460166804 |
10 | 1343000403013 |
11 | 478621796445 |
12 | 19834814b371 |
13 | 9984b9727a9 |
14 | 49004425a73 |
15 | 24e0403050d |
hex | 138b10fdc45 |
1343000403013 has 4 divisors (see below), whose sum is σ = 1349817664140. Its totient is φ = 1336183141888.
The previous prime is 1343000403007. The next prime is 1343000403127. The reversal of 1343000403013 is 3103040003431.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1310241936964 + 32758466049 = 1144658^2 + 180993^2 .
It is a cyclic number.
It is not a de Polignac number, because 1343000403013 - 229 = 1342463532101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1343000403413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3408630268 + ... + 3408630661.
It is an arithmetic number, because the mean of its divisors is an integer number (337454416035).
Almost surely, 21343000403013 is an apocalyptic number.
It is an amenable number.
1343000403013 is a deficient number, since it is larger than the sum of its proper divisors (6817261127).
1343000403013 is an equidigital number, since it uses as much as digits as its factorization.
1343000403013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6817261126.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 1343000403013 its reverse (3103040003431), we get a palindrome (4446040406444).
The spelling of 1343000403013 in words is "one trillion, three hundred forty-three billion, four hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •