Base | Representation |
---|---|
bin | 11110100111110110110… |
… | …00010111100000001111 |
3 | 10201120212220011011121021 |
4 | 33103323120113200033 |
5 | 114214341002123132 |
6 | 2123211424215011 |
7 | 136006144043065 |
oct | 17237330274017 |
9 | 3646786134537 |
10 | 1052189489167 |
11 | 37625a599623 |
12 | 14bb0816a467 |
13 | 782b482998b |
14 | 38cd787a035 |
15 | 1c58344d997 |
hex | f4fb61780f |
1052189489167 has 2 divisors, whose sum is σ = 1052189489168. Its totient is φ = 1052189489166.
The previous prime is 1052189489107. The next prime is 1052189489207. The reversal of 1052189489167 is 7619849812501.
It is a strong prime.
It is an emirp because it is prime and its reverse (7619849812501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1052189489167 is a prime.
It is a super-2 number, since 2×10521894891672 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1052189489107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 526094744583 + 526094744584.
It is an arithmetic number, because the mean of its divisors is an integer number (526094744584).
Almost surely, 21052189489167 is an apocalyptic number.
1052189489167 is a deficient number, since it is larger than the sum of its proper divisors (1).
1052189489167 is an equidigital number, since it uses as much as digits as its factorization.
1052189489167 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8709120, while the sum is 61.
The spelling of 1052189489167 in words is "one trillion, fifty-two billion, one hundred eighty-nine million, four hundred eighty-nine thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •