Base | Representation |
---|---|
bin | 11000011001111100… |
… | …11011001001100001 |
3 | 1020211010211200001202 |
4 | 30030332123021201 |
5 | 203313230430414 |
6 | 10004054010545 |
7 | 642460125311 |
oct | 141476331141 |
9 | 36733750052 |
10 | 13102592609 |
11 | 5614087837 |
12 | 2658046a55 |
13 | 130a7125a2 |
14 | 8c4233441 |
15 | 51a4699de |
hex | 30cf9b261 |
13102592609 has 2 divisors, whose sum is σ = 13102592610. Its totient is φ = 13102592608.
The previous prime is 13102592567. The next prime is 13102592623. The reversal of 13102592609 is 90629520131.
13102592609 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9577558225 + 3525034384 = 97865^2 + 59372^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13102592609 is a prime.
It is a super-5 number, since 5×131025926095 (a number of 52 digits) contains 55555 as substring.
It is not a weakly prime, because it can be changed into another prime (13102592639) 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, 6551296304 + 6551296305.
It is an arithmetic number, because the mean of its divisors is an integer number (6551296305).
Almost surely, 213102592609 is an apocalyptic number.
It is an amenable number.
13102592609 is a deficient number, since it is larger than the sum of its proper divisors (1).
13102592609 is an equidigital number, since it uses as much as digits as its factorization.
13102592609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160, while the sum is 38.
The spelling of 13102592609 in words is "thirteen billion, one hundred two million, five hundred ninety-two thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •