Base | Representation |
---|---|
bin | 1011111101011111110001… |
… | …1111111000111101001001 |
3 | 1201120020100221100110001222 |
4 | 2333113330133320331021 |
5 | 3210432004031024431 |
6 | 43545313552451425 |
7 | 2525065201013144 |
oct | 277277437707511 |
9 | 51506327313058 |
10 | 13151131111241 |
11 | 42103aa732522 |
12 | 158493b249b75 |
13 | 7451b968c266 |
14 | 336737ad305b |
15 | 17c1576e557b |
hex | bf5fc7f8f49 |
13151131111241 has 2 divisors, whose sum is σ = 13151131111242. Its totient is φ = 13151131111240.
The previous prime is 13151131111201. The next prime is 13151131111259. The reversal of 13151131111241 is 14211113115131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12734584788025 + 416546323216 = 3568555^2 + 645404^2 .
It is a cyclic number.
It is not a de Polignac number, because 13151131111241 - 26 = 13151131111177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13151131111241.
It is not a weakly prime, because it can be changed into another prime (13151131111201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6575565555620 + 6575565555621.
It is an arithmetic number, because the mean of its divisors is an integer number (6575565555621).
Almost surely, 213151131111241 is an apocalyptic number.
It is an amenable number.
13151131111241 is a deficient number, since it is larger than the sum of its proper divisors (1).
13151131111241 is an equidigital number, since it uses as much as digits as its factorization.
13151131111241 is an evil number, because the sum of its binary digits is even.
The product of its digits is 360, while the sum is 26.
Adding to 13151131111241 its reverse (14211113115131), we get a palindrome (27362244226372).
The spelling of 13151131111241 in words is "thirteen trillion, one hundred fifty-one billion, one hundred thirty-one million, one hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •