Base | Representation |
---|---|
bin | 10011100011001100011… |
… | …101100111101011100101 |
3 | 11202102201001012221121121 |
4 | 103203030131213223211 |
5 | 134002401242110000 |
6 | 2505102124413541 |
7 | 166030123354504 |
oct | 23431435475345 |
9 | 4672631187547 |
10 | 1343460113125 |
11 | 478838234459 |
12 | 1984560a72b1 |
13 | 998c2c8c100 |
14 | 490494d083b |
15 | 24e2e58ab1a |
hex | 138cc767ae5 |
1343460113125 has 30 divisors (see below), whose sum is σ = 1817859075450. Its totient is φ = 992093544000.
The previous prime is 1343460113117. The next prime is 1343460113161. The reversal of 1343460113125 is 5213110643431.
It can be written as a sum of positive squares in 15 ways, for example, as 1312328333761 + 31131779364 = 1145569^2 + 176442^2 .
It is not a de Polignac number, because 1343460113125 - 23 = 1343460113117 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 6253950 + ... + 6465199.
It is an arithmetic number, because the mean of its divisors is an integer number (60595302515).
Almost surely, 21343460113125 is an apocalyptic number.
It is an amenable number.
1343460113125 is a deficient number, since it is larger than the sum of its proper divisors (474398962325).
1343460113125 is an equidigital number, since it uses as much as digits as its factorization.
1343460113125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12719195 (or 12719167 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 34.
Adding to 1343460113125 its reverse (5213110643431), we get a palindrome (6556570756556).
The spelling of 1343460113125 in words is "one trillion, three hundred forty-three billion, four hundred sixty million, one hundred thirteen thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •