Base | Representation |
---|---|
bin | 11001101010100111… |
… | …01101100100000101 |
3 | 1022120022010000112222 |
4 | 30311103231210011 |
5 | 211204442333301 |
6 | 10155145222125 |
7 | 665314535432 |
oct | 146523554405 |
9 | 38508100488 |
10 | 13779261701 |
11 | 5931041297 |
12 | 2806791945 |
13 | 13b79733ba |
14 | 94a056b89 |
15 | 559a7e31b |
hex | 3354ed905 |
13779261701 has 2 divisors, whose sum is σ = 13779261702. Its totient is φ = 13779261700.
The previous prime is 13779261647. The next prime is 13779261733. The reversal of 13779261701 is 10716297731.
It is a happy number.
13779261701 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., 13098573601 + 680688100 = 114449^2 + 26090^2 .
It is an emirp because it is prime and its reverse (10716297731) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13779261701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13779261101) 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, 6889630850 + 6889630851.
It is an arithmetic number, because the mean of its divisors is an integer number (6889630851).
Almost surely, 213779261701 is an apocalyptic number.
It is an amenable number.
13779261701 is a deficient number, since it is larger than the sum of its proper divisors (1).
13779261701 is an equidigital number, since it uses as much as digits as its factorization.
13779261701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 111132, while the sum is 44.
The spelling of 13779261701 in words is "thirteen billion, seven hundred seventy-nine million, two hundred sixty-one thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •