Base | Representation |
---|---|
bin | 110001000111… |
… | …100101100011 |
3 | 220020011201202 |
4 | 301013211203 |
5 | 11244014011 |
6 | 1135551415 |
7 | 214305512 |
oct | 61074543 |
9 | 26204652 |
10 | 12876131 |
11 | 72a5034 |
12 | 438b56b |
13 | 288aa18 |
14 | 19d2679 |
15 | 11e523b |
hex | c47963 |
12876131 has 4 divisors (see below), whose sum is σ = 13039200. Its totient is φ = 12713064.
The previous prime is 12876103. The next prime is 12876137. The reversal of 12876131 is 13167821.
12876131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13167821 = 1327 ⋅9923.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12876131 is a prime.
It is a super-2 number, since 2×128761312 = 331589499058322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12876094 and 12876103.
It is not an unprimeable number, because it can be changed into a prime (12876137) 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, 81416 + ... + 81573.
It is an arithmetic number, because the mean of its divisors is an integer number (3259800).
Almost surely, 212876131 is an apocalyptic number.
12876131 is a deficient number, since it is larger than the sum of its proper divisors (163069).
12876131 is an equidigital number, since it uses as much as digits as its factorization.
12876131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163068.
The product of its digits is 2016, while the sum is 29.
The square root of 12876131 is about 3588.3326211487. The cubic root of 12876131 is about 234.3842701163.
The spelling of 12876131 in words is "twelve million, eight hundred seventy-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •