Base | Representation |
---|---|
bin | 10110011011110001… |
… | …01000110101000011 |
3 | 1011002101010020111112 |
4 | 23031320220311003 |
5 | 144131243024141 |
6 | 5311043033535 |
7 | 604315153511 |
oct | 131570506503 |
9 | 34071106445 |
10 | 12044111171 |
11 | 512064aa94 |
12 | 240166b8ab |
13 | 119c33a701 |
14 | 8238214b1 |
15 | 4a75857eb |
hex | 2cde28d43 |
12044111171 has 2 divisors, whose sum is σ = 12044111172. Its totient is φ = 12044111170.
The previous prime is 12044111071. The next prime is 12044111173. The reversal of 12044111171 is 17111144021.
It is a happy number.
12044111171 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 12044111171 - 214 = 12044094787 is a prime.
It is a super-2 number, since 2×120441111712 (a number of 21 digits) contains 22 as substring.
Together with 12044111173, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (12044111173) 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, 6022055585 + 6022055586.
It is an arithmetic number, because the mean of its divisors is an integer number (6022055586).
Almost surely, 212044111171 is an apocalyptic number.
12044111171 is a deficient number, since it is larger than the sum of its proper divisors (1).
12044111171 is an equidigital number, since it uses as much as digits as its factorization.
12044111171 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 23.
Adding to 12044111171 its reverse (17111144021), we get a palindrome (29155255192).
The spelling of 12044111171 in words is "twelve billion, forty-four million, one hundred eleven thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •