Base | Representation |
---|---|
bin | 11000001111010011… |
… | …00110011000100111 |
3 | 1020120220201110122122 |
4 | 30013221212120213 |
5 | 203122342410102 |
6 | 5551143020155 |
7 | 640323531110 |
oct | 140751463047 |
9 | 36526643578 |
10 | 13013247527 |
11 | 5578703525 |
12 | 263213a65b |
13 | 12c505c787 |
14 | 8b6417207 |
15 | 5126bc0a2 |
hex | 307a66627 |
13013247527 has 16 divisors (see below), whose sum is σ = 15171566592. Its totient is φ = 10931984640.
The previous prime is 13013247461. The next prime is 13013247551. The reversal of 13013247527 is 72574231031.
It is a happy number.
13013247527 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13013247527 is a prime.
It is a super-2 number, since 2×130132475272 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13013247827) 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, 23099 + ... + 162972.
It is an arithmetic number, because the mean of its divisors is an integer number (948222912).
Almost surely, 213013247527 is an apocalyptic number.
13013247527 is a deficient number, since it is larger than the sum of its proper divisors (2158319065).
13013247527 is a wasteful number, since it uses less digits than its factorization.
13013247527 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186278.
The product of its (nonzero) digits is 35280, while the sum is 35.
Adding to 13013247527 its reverse (72574231031), we get a palindrome (85587478558).
The spelling of 13013247527 in words is "thirteen billion, thirteen million, two hundred forty-seven thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •