Base | Representation |
---|---|
bin | 10011100000011000101… |
… | …101010000101000010101 |
3 | 11202010220212110111010122 |
4 | 103200120231100220111 |
5 | 133430212221023013 |
6 | 2503442553401325 |
7 | 165562313450561 |
oct | 23403055205025 |
9 | 4663825414118 |
10 | 1340444314133 |
11 | 47752a962aa1 |
12 | 197954109245 |
13 | 99532235672 |
14 | 48c40b746a1 |
15 | 24d04925a08 |
hex | 13818b50a15 |
1340444314133 has 8 divisors (see below), whose sum is σ = 1421654413056. Its totient is φ = 1261145041200.
The previous prime is 1340444314127. The next prime is 1340444314147. The reversal of 1340444314133 is 3314134440431.
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 1340444314133 - 28 = 1340444313877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1340444314093 and 1340444314102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1340444344133) 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, 477705053 + ... + 477707858.
It is an arithmetic number, because the mean of its divisors is an integer number (177706801632).
Almost surely, 21340444314133 is an apocalyptic number.
It is an amenable number.
1340444314133 is a deficient number, since it is larger than the sum of its proper divisors (81210098923).
1340444314133 is an equidigital number, since it uses as much as digits as its factorization.
1340444314133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 955412995.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 1340444314133 its reverse (3314134440431), we get a palindrome (4654578754564).
The spelling of 1340444314133 in words is "one trillion, three hundred forty billion, four hundred forty-four million, three hundred fourteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •