Base | Representation |
---|---|
bin | 11000010100111010… |
… | …01001000111011101 |
3 | 1020201012021200010020 |
4 | 30022131021013131 |
5 | 203221420013230 |
6 | 5555543502353 |
7 | 641434555635 |
oct | 141235110735 |
9 | 36635250106 |
10 | 13060313565 |
11 | 55a222a982 |
12 | 2645a579b9 |
13 | 1301a2b5c0 |
14 | 8bc7896c5 |
15 | 5168b7810 |
hex | 30a7491dd |
13060313565 has 64 divisors (see below), whose sum is σ = 22864536576. Its totient is φ = 6327078912.
The previous prime is 13060313543. The next prime is 13060313579. The reversal of 13060313565 is 56531306031.
13060313565 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13060313565 - 25 = 13060313533 is a prime.
It is a super-2 number, since 2×130603135652 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 8782252 + ... + 8783738.
It is an arithmetic number, because the mean of its divisors is an integer number (357258384).
Almost surely, 213060313565 is an apocalyptic number.
13060313565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
13060313565 is a deficient number, since it is larger than the sum of its proper divisors (9804223011).
13060313565 is a wasteful number, since it uses less digits than its factorization.
13060313565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2198.
The product of its (nonzero) digits is 24300, while the sum is 33.
Adding to 13060313565 its reverse (56531306031), we get a palindrome (69591619596).
The spelling of 13060313565 in words is "thirteen billion, sixty million, three hundred thirteen thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •