Base | Representation |
---|---|
bin | 11001000010010111… |
… | …01011110100010101 |
3 | 1021200202202200201101 |
4 | 30201023223310111 |
5 | 210012023104302 |
6 | 10101444230101 |
7 | 654044553214 |
oct | 144113536425 |
9 | 37622680641 |
10 | 13441613077 |
11 | 5778492942 |
12 | 273169b331 |
13 | 1362a23109 |
14 | 91728307b |
15 | 53a0d5287 |
hex | 3212ebd15 |
13441613077 has 2 divisors, whose sum is σ = 13441613078. Its totient is φ = 13441613076.
The previous prime is 13441613033. The next prime is 13441613161. The reversal of 13441613077 is 77031614431.
13441613077 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13335399441 + 106213636 = 115479^2 + 10306^2 .
It is a cyclic number.
It is not a de Polignac number, because 13441613077 - 27 = 13441612949 is a prime.
It is a super-2 number, since 2×134416130772 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13441613027) 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, 6720806538 + 6720806539.
It is an arithmetic number, because the mean of its divisors is an integer number (6720806539).
Almost surely, 213441613077 is an apocalyptic number.
It is an amenable number.
13441613077 is a deficient number, since it is larger than the sum of its proper divisors (1).
13441613077 is an equidigital number, since it uses as much as digits as its factorization.
13441613077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42336, while the sum is 37.
The spelling of 13441613077 in words is "thirteen billion, four hundred forty-one million, six hundred thirteen thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •