Base | Representation |
---|---|
bin | 10110000001000111001… |
… | …110101101000010010100 |
3 | 12100122101012200202102210 |
4 | 112001013032231002110 |
5 | 144242133010300022 |
6 | 3115023505033420 |
7 | 214212063523146 |
oct | 26010716550224 |
9 | 5318335622383 |
10 | 1513023525012 |
11 | 5337403764aa |
12 | 205298625870 |
13 | ac8a663401c |
14 | 5333319ac96 |
15 | 295558e6a0c |
hex | 160473ad094 |
1513023525012 has 48 divisors (see below), whose sum is σ = 3560583704832. Its totient is φ = 500041476480.
The previous prime is 1513023524963. The next prime is 1513023525017. The reversal of 1513023525012 is 2105253203151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1513023525017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2508 + ... + 1739555.
It is an arithmetic number, because the mean of its divisors is an integer number (74178827184).
Almost surely, 21513023525012 is an apocalyptic number.
1513023525012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1513023525012 is an abundant number, since it is smaller than the sum of its proper divisors (2047560179820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1513023525012 is a wasteful number, since it uses less digits than its factorization.
1513023525012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1742688 (or 1742686 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 1513023525012 its reverse (2105253203151), we get a palindrome (3618276728163).
The spelling of 1513023525012 in words is "one trillion, five hundred thirteen billion, twenty-three million, five hundred twenty-five thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.026 sec. • engine limits •