Base | Representation |
---|---|
bin | 11001001100011110… |
… | …01010011110000101 |
3 | 1021220200022212210102 |
4 | 30212033022132011 |
5 | 210200230124031 |
6 | 10114113533445 |
7 | 656124411665 |
oct | 144617123605 |
9 | 37820285712 |
10 | 13526411141 |
11 | 5811340991 |
12 | 2755b74285 |
13 | 1377473399 |
14 | 9246381a5 |
15 | 5427857cb |
hex | 3263ca785 |
13526411141 has 2 divisors, whose sum is σ = 13526411142. Its totient is φ = 13526411140.
The previous prime is 13526411077. The next prime is 13526411149. The reversal of 13526411141 is 14111462531.
13526411141 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., 11900628100 + 1625783041 = 109090^2 + 40321^2 .
It is a cyclic number.
It is not a de Polignac number, because 13526411141 - 26 = 13526411077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13526411149) 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, 6763205570 + 6763205571.
It is an arithmetic number, because the mean of its divisors is an integer number (6763205571).
Almost surely, 213526411141 is an apocalyptic number.
It is an amenable number.
13526411141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13526411141 is an equidigital number, since it uses as much as digits as its factorization.
13526411141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2880, while the sum is 29.
Adding to 13526411141 its reverse (14111462531), we get a palindrome (27637873672).
The spelling of 13526411141 in words is "thirteen billion, five hundred twenty-six million, four hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •