Base | Representation |
---|---|
bin | 11000101001010001… |
… | …01001010010000101 |
3 | 1021011002122120112001 |
4 | 30110220221102011 |
5 | 204044130213221 |
6 | 10024524225301 |
7 | 645610334443 |
oct | 142450512205 |
9 | 37132576461 |
10 | 13231101061 |
11 | 567a680072 |
12 | 269309b231 |
13 | 132b2281a9 |
14 | 8d7325b93 |
15 | 5268a1391 |
hex | 314a29485 |
13231101061 has 2 divisors, whose sum is σ = 13231101062. Its totient is φ = 13231101060.
The previous prime is 13231101011. The next prime is 13231101067. The reversal of 13231101061 is 16010113231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13072492225 + 158608836 = 114335^2 + 12594^2 .
It is a cyclic number.
It is not a de Polignac number, because 13231101061 - 215 = 13231068293 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13231101067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6615550530 + 6615550531.
It is an arithmetic number, because the mean of its divisors is an integer number (6615550531).
Almost surely, 213231101061 is an apocalyptic number.
It is an amenable number.
13231101061 is a deficient number, since it is larger than the sum of its proper divisors (1).
13231101061 is an equidigital number, since it uses as much as digits as its factorization.
13231101061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13231101061 its reverse (16010113231), we get a palindrome (29241214292).
The spelling of 13231101061 in words is "thirteen billion, two hundred thirty-one million, one hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •