Base | Representation |
---|---|
bin | 1111110001111100010… |
… | …1001101101101110001 |
3 | 221220202201202110200122 |
4 | 3330133011031231301 |
5 | 13420210211301431 |
6 | 324313232100025 |
7 | 25405135244303 |
oct | 3743705155561 |
9 | 856681673618 |
10 | 271104400241 |
11 | a4a7a403544 |
12 | 44660394615 |
13 | 1c7464c829c |
14 | d19b65d973 |
15 | 70ba9d9a7b |
hex | 3f1f14db71 |
271104400241 has 2 divisors, whose sum is σ = 271104400242. Its totient is φ = 271104400240.
The previous prime is 271104400219. The next prime is 271104400243. The reversal of 271104400241 is 142004401172.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 218145043600 + 52959356641 = 467060^2 + 230129^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-271104400241 is a prime.
Together with 271104400243, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 271104400241.
It is not a weakly prime, because it can be changed into another prime (271104400243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 135552200120 + 135552200121.
It is an arithmetic number, because the mean of its divisors is an integer number (135552200121).
Almost surely, 2271104400241 is an apocalyptic number.
It is an amenable number.
271104400241 is a deficient number, since it is larger than the sum of its proper divisors (1).
271104400241 is an equidigital number, since it uses as much as digits as its factorization.
271104400241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 26.
The spelling of 271104400241 in words is "two hundred seventy-one billion, one hundred four million, four hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •