Base | Representation |
---|---|
bin | 10110110010000100… |
… | …10001011110101011 |
3 | 1011120102010122101202 |
4 | 23121002101132223 |
5 | 200022140430342 |
6 | 5341404434415 |
7 | 612046240262 |
oct | 133102213653 |
9 | 34512118352 |
10 | 12231186347 |
11 | 5207205376 |
12 | 2454248a0b |
13 | 11cc01aa93 |
14 | 8405db5d9 |
15 | 4b8bda332 |
hex | 2d90917ab |
12231186347 has 2 divisors, whose sum is σ = 12231186348. Its totient is φ = 12231186346.
The previous prime is 12231186343. The next prime is 12231186349. The reversal of 12231186347 is 74368113221.
12231186347 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12231186347 - 22 = 12231186343 is a prime.
Together with 12231186349, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12231186347.
It is not a weakly prime, because it can be changed into another prime (12231186343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6115593173 + 6115593174.
It is an arithmetic number, because the mean of its divisors is an integer number (6115593174).
Almost surely, 212231186347 is an apocalyptic number.
12231186347 is a deficient number, since it is larger than the sum of its proper divisors (1).
12231186347 is an equidigital number, since it uses as much as digits as its factorization.
12231186347 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48384, while the sum is 38.
Adding to 12231186347 its reverse (74368113221), we get a palindrome (86599299568).
The spelling of 12231186347 in words is "twelve billion, two hundred thirty-one million, one hundred eighty-six thousand, three hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •