Base | Representation |
---|---|
bin | 100111000101010… |
… | …0111101101100101 |
3 | 10101101122101010202 |
4 | 1032022213231211 |
5 | 10141210010244 |
6 | 334044000245 |
7 | 44332526606 |
oct | 11612475545 |
9 | 3341571122 |
10 | 1311406949 |
11 | 6132894a6 |
12 | 307230085 |
13 | 17b900058 |
14 | c624ddad |
15 | 7a1e504e |
hex | 4e2a7b65 |
1311406949 has 2 divisors, whose sum is σ = 1311406950. Its totient is φ = 1311406948.
The previous prime is 1311406909. The next prime is 1311406963. The reversal of 1311406949 is 9496041131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 788598724 + 522808225 = 28082^2 + 22865^2 .
It is an emirp because it is prime and its reverse (9496041131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1311406949 - 28 = 1311406693 is a prime.
It is a super-3 number, since 3×13114069493 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311406909) 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, 655703474 + 655703475.
It is an arithmetic number, because the mean of its divisors is an integer number (655703475).
Almost surely, 21311406949 is an apocalyptic number.
It is an amenable number.
1311406949 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311406949 is an equidigital number, since it uses as much as digits as its factorization.
1311406949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 38.
The square root of 1311406949 is about 36213.3531863593. The cubic root of 1311406949 is about 1094.5757616530.
The spelling of 1311406949 in words is "one billion, three hundred eleven million, four hundred six thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.362 sec. • engine limits •