Base | Representation |
---|---|
bin | 10011101100001000001… |
… | …100111101111101111001 |
3 | 11210100110112122022120201 |
4 | 103230020030331331321 |
5 | 134132022343044023 |
6 | 2513330022522201 |
7 | 166516616630233 |
oct | 23541014757571 |
9 | 4710415568521 |
10 | 1353052315513 |
11 | 48190a838048 |
12 | 19a292596361 |
13 | 9a791337a02 |
14 | 496b941d253 |
15 | 252e1744bad |
hex | 13b0833df79 |
1353052315513 has 8 divisors (see below), whose sum is σ = 1408296470400. Its totient is φ = 1298380639248.
The previous prime is 1353052315507. The next prime is 1353052315519. The reversal of 1353052315513 is 3155132503531.
It is an interprime number because it is at equal distance from previous prime (1353052315507) and next prime (1353052315519).
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 1353052315513 - 25 = 1353052315481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1353052315519) 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 7 ways as a sum of consecutive naturals, for example, 143114833 + ... + 143124286.
It is an arithmetic number, because the mean of its divisors is an integer number (176037058800).
Almost surely, 21353052315513 is an apocalyptic number.
It is an amenable number.
1353052315513 is a deficient number, since it is larger than the sum of its proper divisors (55244154887).
1353052315513 is a wasteful number, since it uses less digits than its factorization.
1353052315513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286239311.
The product of its (nonzero) digits is 101250, while the sum is 37.
The spelling of 1353052315513 in words is "one trillion, three hundred fifty-three billion, fifty-two million, three hundred fifteen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •