Base | Representation |
---|---|
bin | 11000011010010010… |
… | …11111001011001111 |
3 | 1020211100022000020001 |
4 | 30031021133023033 |
5 | 203320001231222 |
6 | 10004240105131 |
7 | 642523564330 |
oct | 141511371317 |
9 | 36740260201 |
10 | 13105492687 |
11 | 56157886a1 |
12 | 26590051a7 |
13 | 130b1b9601 |
14 | 8c478a287 |
15 | 51a83de27 |
hex | 30d25f2cf |
13105492687 has 16 divisors (see below), whose sum is σ = 15774312960. Its totient is φ = 10636447392.
The previous prime is 13105492669. The next prime is 13105492693. The reversal of 13105492687 is 78629450131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13105492687 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13105492087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 237438 + ... + 287380.
It is an arithmetic number, because the mean of its divisors is an integer number (985894560).
It is a 2-persistent number, because it is pandigital, and so is 2⋅13105492687 = 26210985374, but 3⋅13105492687 = 39316478061 is not.
Almost surely, 213105492687 is an apocalyptic number.
13105492687 is a deficient number, since it is larger than the sum of its proper divisors (2668820273).
13105492687 is a wasteful number, since it uses less digits than its factorization.
13105492687 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51942.
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 13105492687 in words is "thirteen billion, one hundred five million, four hundred ninety-two thousand, six hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •