Base | Representation |
---|---|
bin | 100111000101001… |
… | …0000100110110111 |
3 | 10101101110120022122 |
4 | 1032022100212313 |
5 | 10141143443221 |
6 | 334041550155 |
7 | 44331653651 |
oct | 11612204667 |
9 | 3341416278 |
10 | 1311312311 |
11 | 613224391 |
12 | 3071a535b |
13 | 17b898c5a |
14 | c62276d1 |
15 | 7a1c6eab |
hex | 4e2909b7 |
1311312311 has 4 divisors (see below), whose sum is σ = 1311568224. Its totient is φ = 1311056400.
The previous prime is 1311312283. The next prime is 1311312313. The reversal of 1311312311 is 1132131131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1132131131 = 19 ⋅59585849.
It is a cyclic number.
It is not a de Polignac number, because 1311312311 - 226 = 1244203447 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1311312311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311312313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 120110 + ... + 130571.
It is an arithmetic number, because the mean of its divisors is an integer number (327892056).
Almost surely, 21311312311 is an apocalyptic number.
1311312311 is a deficient number, since it is larger than the sum of its proper divisors (255913).
1311312311 is an equidigital number, since it uses as much as digits as its factorization.
1311312311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255912.
The product of its digits is 54, while the sum is 17.
The square root of 1311312311 is about 36212.0464900839. The cubic root of 1311312311 is about 1094.5494309113.
Adding to 1311312311 its reverse (1132131131), we get a palindrome (2443443442).
The spelling of 1311312311 in words is "one billion, three hundred eleven million, three hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •