Base | Representation |
---|---|
bin | 10011001001101011010… |
… | …111111101101010001001 |
3 | 11122210222120202222010122 |
4 | 103021223113331222021 |
5 | 133030243211432203 |
6 | 2444331255553025 |
7 | 164040141431123 |
oct | 23115327755211 |
9 | 4583876688118 |
10 | 1316061436553 |
11 | 46815840a1a6 |
12 | 19308a38b775 |
13 | 97147811456 |
14 | 479aa750213 |
15 | 24379004538 |
hex | 1326b5fda89 |
1316061436553 has 4 divisors (see below), whose sum is σ = 1329091747908. Its totient is φ = 1303031125200.
The previous prime is 1316061436519. The next prime is 1316061436601. The reversal of 1316061436553 is 3556341606131.
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 1009647155344 + 306414281209 = 1004812^2 + 553547^2 .
It is a cyclic number.
It is not a de Polignac number, because 1316061436553 - 216 = 1316061371017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1316061436513) by changing a digit.
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, 6515155526 + ... + 6515155727.
It is an arithmetic number, because the mean of its divisors is an integer number (332272936977).
Almost surely, 21316061436553 is an apocalyptic number.
It is an amenable number.
1316061436553 is a deficient number, since it is larger than the sum of its proper divisors (13030311355).
1316061436553 is a wasteful number, since it uses less digits than its factorization.
1316061436553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13030311354.
The product of its (nonzero) digits is 583200, while the sum is 44.
The spelling of 1316061436553 in words is "one trillion, three hundred sixteen billion, sixty-one million, four hundred thirty-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •