Base | Representation |
---|---|
bin | 101110010001… |
… | …110110111101 |
3 | 211211100122221 |
4 | 232101312331 |
5 | 11101204043 |
6 | 1112005341 |
7 | 205055413 |
oct | 56216675 |
9 | 24740587 |
10 | 12131773 |
11 | 6936865 |
12 | 4090851 |
13 | 2689c84 |
14 | 187b2b3 |
15 | 10e98ed |
hex | b91dbd |
12131773 has 4 divisors (see below), whose sum is σ = 12550140. Its totient is φ = 11713408.
The previous prime is 12131771. The next prime is 12131789. The reversal of 12131773 is 37713121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6285049 + 5846724 = 2507^2 + 2418^2 .
It is a cyclic number.
It is not a de Polignac number, because 12131773 - 21 = 12131771 is a prime.
It is a super-2 number, since 2×121317732 = 294359832247058, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12131771) 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, 209140 + ... + 209197.
It is an arithmetic number, because the mean of its divisors is an integer number (3137535).
Almost surely, 212131773 is an apocalyptic number.
It is an amenable number.
12131773 is a deficient number, since it is larger than the sum of its proper divisors (418367).
12131773 is an equidigital number, since it uses as much as digits as its factorization.
12131773 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418366.
The product of its digits is 882, while the sum is 25.
The square root of 12131773 is about 3483.0694796400. The cubic root of 12131773 is about 229.7778131553. Note that the first 3 decimals are identical.
Adding to 12131773 its reverse (37713121), we get a palindrome (49844894).
The spelling of 12131773 in words is "twelve million, one hundred thirty-one thousand, seven hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •