Base | Representation |
---|---|
bin | 100111101011011… |
… | …1011100100111101 |
3 | 10102210021200220012 |
4 | 1033112323210331 |
5 | 10211320130021 |
6 | 340040433005 |
7 | 44664544325 |
oct | 11726734475 |
9 | 3383250805 |
10 | 1331411261 |
11 | 623601a94 |
12 | 311a78765 |
13 | 182ab541b |
14 | c8b7a285 |
15 | 7bd4735b |
hex | 4f5bb93d |
1331411261 has 2 divisors, whose sum is σ = 1331411262. Its totient is φ = 1331411260.
The previous prime is 1331411227. The next prime is 1331411299. The reversal of 1331411261 is 1621141331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1331155225 + 256036 = 36485^2 + 506^2 .
It is an emirp because it is prime and its reverse (1621141331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1331411261 - 26 = 1331411197 is a prime.
It is a super-2 number, since 2×13314112612 = 3545311891835220242, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1331411161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665705630 + 665705631.
It is an arithmetic number, because the mean of its divisors is an integer number (665705631).
Almost surely, 21331411261 is an apocalyptic number.
It is an amenable number.
1331411261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1331411261 is an equidigital number, since it uses as much as digits as its factorization.
1331411261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 432, while the sum is 23.
The square root of 1331411261 is about 36488.5086157272. The cubic root of 1331411261 is about 1100.1132833744.
Adding to 1331411261 its reverse (1621141331), we get a palindrome (2952552592).
The spelling of 1331411261 in words is "one billion, three hundred thirty-one million, four hundred eleven thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •