Base | Representation |
---|---|
bin | 11000011110110010… |
… | …11010011101110011 |
3 | 1020220222021212021212 |
4 | 30033121122131303 |
5 | 203404131102011 |
6 | 10012104510335 |
7 | 643462354604 |
oct | 141731323563 |
9 | 36828255255 |
10 | 13143222131 |
11 | 5635008356 |
12 | 266977b3ab |
13 | 1315c69820 |
14 | 8c97abdab |
15 | 51dce308b |
hex | 30f65a773 |
13143222131 has 4 divisors (see below), whose sum is σ = 14154239232. Its totient is φ = 12132205032.
The previous prime is 13143222091. The next prime is 13143222133. The reversal of 13143222131 is 13122234131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13122234131 = 41 ⋅320054491.
It is a cyclic number.
It is not a de Polignac number, because 13143222131 - 26 = 13143222067 is a prime.
It is a super-2 number, since 2×131432221312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13143222097 and 13143222106.
It is not an unprimeable number, because it can be changed into a prime (13143222133) 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, 505508531 + ... + 505508556.
It is an arithmetic number, because the mean of its divisors is an integer number (3538559808).
Almost surely, 213143222131 is an apocalyptic number.
13143222131 is a deficient number, since it is larger than the sum of its proper divisors (1011017101).
13143222131 is a wasteful number, since it uses less digits than its factorization.
13143222131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1011017100.
The product of its digits is 864, while the sum is 23.
Adding to 13143222131 its reverse (13122234131), we get a palindrome (26265456262).
The spelling of 13143222131 in words is "thirteen billion, one hundred forty-three million, two hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •