Base | Representation |
---|---|
bin | 10011100100101111000… |
… | …011001101011111101001 |
3 | 11202120222022112221101201 |
4 | 103210233003031133221 |
5 | 134014243204301010 |
6 | 2505534212044201 |
7 | 166116116331331 |
oct | 23445703153751 |
9 | 4676868487351 |
10 | 1345114134505 |
11 | 479506953179 |
12 | 198838003661 |
13 | 99ac785a79b |
14 | 491650480c1 |
15 | 24ec98ab23a |
hex | 1392f0cd7e9 |
1345114134505 has 4 divisors (see below), whose sum is σ = 1614136961412. Its totient is φ = 1076091307600.
The previous prime is 1345114134473. The next prime is 1345114134517. The reversal of 1345114134505 is 5054314115431.
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 197381164176 + 1147732970329 = 444276^2 + 1071323^2 .
It is not a de Polignac number, because 1345114134505 - 25 = 1345114134473 is a prime.
It is a Duffinian 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 3 ways as a sum of consecutive naturals, for example, 134511413446 + ... + 134511413455.
It is an arithmetic number, because the mean of its divisors is an integer number (403534240353).
Almost surely, 21345114134505 is an apocalyptic number.
It is an amenable number.
1345114134505 is a deficient number, since it is larger than the sum of its proper divisors (269022826907).
1345114134505 is an equidigital number, since it uses as much as digits as its factorization.
1345114134505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269022826906.
The product of its (nonzero) digits is 72000, while the sum is 37.
Adding to 1345114134505 its reverse (5054314115431), we get a palindrome (6399428249936).
The spelling of 1345114134505 in words is "one trillion, three hundred forty-five billion, one hundred fourteen million, one hundred thirty-four thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •