Base | Representation |
---|---|
bin | 11000110010010100… |
… | …01010001111010111 |
3 | 1021100101110102100112 |
4 | 30121022022033113 |
5 | 204223042330141 |
6 | 10040235033235 |
7 | 650521411514 |
oct | 143112121727 |
9 | 37311412315 |
10 | 13306995671 |
11 | 57094a7892 |
12 | 26b459b81b |
13 | 1340b7ba48 |
14 | 90344030b |
15 | 52d3937eb |
hex | 31928a3d7 |
13306995671 has 2 divisors, whose sum is σ = 13306995672. Its totient is φ = 13306995670.
The previous prime is 13306995659. The next prime is 13306995673. The reversal of 13306995671 is 17659960331.
13306995671 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 is a cyclic number.
It is not a de Polignac number, because 13306995671 - 26 = 13306995607 is a prime.
It is a super-2 number, since 2×133069956712 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 13306995673, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13306995673) 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, 6653497835 + 6653497836.
It is an arithmetic number, because the mean of its divisors is an integer number (6653497836).
Almost surely, 213306995671 is an apocalyptic number.
13306995671 is a deficient number, since it is larger than the sum of its proper divisors (1).
13306995671 is an equidigital number, since it uses as much as digits as its factorization.
13306995671 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 918540, while the sum is 50.
The spelling of 13306995671 in words is "thirteen billion, three hundred six million, nine hundred ninety-five thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •