Base | Representation |
---|---|
bin | 10011000111011001000… |
… | …001011011010011101001 |
3 | 11122120122110112200001111 |
4 | 103013121001123103221 |
5 | 133010231122231040 |
6 | 2443243504350321 |
7 | 163622245144546 |
oct | 23073101332351 |
9 | 4576573480044 |
10 | 1313606055145 |
11 | 46710841086a |
12 | 1927040153a1 |
13 | 96b45c04b47 |
14 | 478165d5bcd |
15 | 2428368ddea |
hex | 131d905b4e9 |
1313606055145 has 8 divisors (see below), whose sum is σ = 1576398619656. Its totient is φ = 1050837275136.
The previous prime is 1313606055121. The next prime is 1313606055197. The reversal of 1313606055145 is 5415506063131.
It can be written as a sum of positive squares in 4 ways, for example, as 168014730816 + 1145591324329 = 409896^2 + 1070323^2 .
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 1313606055145 - 213 = 1313606046953 is a prime.
It is a super-2 number, since 2×13136060551452 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1313606055098 and 1313606055107.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5824392 + ... + 6045721.
It is an arithmetic number, because the mean of its divisors is an integer number (197049827457).
Almost surely, 21313606055145 is an apocalyptic number.
It is an amenable number.
1313606055145 is a deficient number, since it is larger than the sum of its proper divisors (262792564511).
1313606055145 is a wasteful number, since it uses less digits than its factorization.
1313606055145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11892251.
The product of its (nonzero) digits is 162000, while the sum is 40.
The spelling of 1313606055145 in words is "one trillion, three hundred thirteen billion, six hundred six million, fifty-five thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •