Base | Representation |
---|---|
bin | 10110000001011001100… |
… | …001110011100010000011 |
3 | 12100200011121100211110121 |
4 | 112001121201303202003 |
5 | 144243300103202433 |
6 | 3115114153041111 |
7 | 214222512124621 |
oct | 26013141634203 |
9 | 5320147324417 |
10 | 1513330522243 |
11 | 53388869a021 |
12 | 2053633b6197 |
13 | ac9251119a7 |
14 | 53361c72511 |
15 | 29572838c2d |
hex | 16059873883 |
1513330522243 has 2 divisors, whose sum is σ = 1513330522244. Its totient is φ = 1513330522242.
The previous prime is 1513330522213. The next prime is 1513330522259. The reversal of 1513330522243 is 3422250333151.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1513330522243 is a prime.
It is a super-2 number, since 2×15133305222432 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1513330522199 and 1513330522208.
It is not a weakly prime, because it can be changed into another prime (1513330522213) 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 as a sum of consecutive naturals, namely, 756665261121 + 756665261122.
It is an arithmetic number, because the mean of its divisors is an integer number (756665261122).
Almost surely, 21513330522243 is an apocalyptic number.
1513330522243 is a deficient number, since it is larger than the sum of its proper divisors (1).
1513330522243 is an equidigital number, since it uses as much as digits as its factorization.
1513330522243 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 34.
Adding to 1513330522243 its reverse (3422250333151), we get a palindrome (4935580855394).
The spelling of 1513330522243 in words is "one trillion, five hundred thirteen billion, three hundred thirty million, five hundred twenty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •