Base | Representation |
---|---|
bin | 100111000100110… |
… | …0111000101001111 |
3 | 10101101010221000002 |
4 | 1032021213011033 |
5 | 10141123022343 |
6 | 334034154515 |
7 | 44330345036 |
oct | 11611470517 |
9 | 3341127002 |
10 | 1311142223 |
11 | 613118616 |
12 | 307122a3b |
13 | 17b839701 |
14 | c61c171d |
15 | 7a1918b8 |
hex | 4e26714f |
1311142223 has 4 divisors (see below), whose sum is σ = 1327739040. Its totient is φ = 1294545408.
The previous prime is 1311142199. The next prime is 1311142237. The reversal of 1311142223 is 3222411131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3222411131 = 42829 ⋅75239.
It is a cyclic number.
It is not a de Polignac number, because 1311142223 - 216 = 1311076687 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1311142195 and 1311142204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311142523) 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, 8298290 + ... + 8298447.
It is an arithmetic number, because the mean of its divisors is an integer number (331934760).
Almost surely, 21311142223 is an apocalyptic number.
1311142223 is a deficient number, since it is larger than the sum of its proper divisors (16596817).
1311142223 is an equidigital number, since it uses as much as digits as its factorization.
1311142223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16596816.
The product of its digits is 288, while the sum is 20.
The square root of 1311142223 is about 36209.6979136805. The cubic root of 1311142223 is about 1094.5021048417.
Adding to 1311142223 its reverse (3222411131), we get a palindrome (4533553354).
The spelling of 1311142223 in words is "one billion, three hundred eleven million, one hundred forty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •