Base | Representation |
---|---|
bin | 100101000001110010001… |
… | …1111110110001100101001 |
3 | 200000111210101010102212022 |
4 | 1022003210133312030221 |
5 | 1131334411124112134 |
6 | 14453515543154225 |
7 | 1033450006225316 |
oct | 112034437661451 |
9 | 20014711112768 |
10 | 5089074832169 |
11 | 16922a0086339 |
12 | 6a2368a45975 |
13 | 2abb8931a453 |
14 | 138453855d0d |
15 | 8c5a274e52e |
hex | 4a0e47f6329 |
5089074832169 has 2 divisors, whose sum is σ = 5089074832170. Its totient is φ = 5089074832168.
The previous prime is 5089074832129. The next prime is 5089074832201. The reversal of 5089074832169 is 9612384709805.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3984063904144 + 1105010928025 = 1996012^2 + 1051195^2 .
It is a cyclic number.
It is not a de Polignac number, because 5089074832169 - 28 = 5089074831913 is a prime.
It is a super-3 number, since 3×50890748321693 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (5089074832129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2544537416084 + 2544537416085.
It is an arithmetic number, because the mean of its divisors is an integer number (2544537416085).
It is a 1-persistent number, because it is pandigital, but 2⋅5089074832169 = 10178149664338 is not.
Almost surely, 25089074832169 is an apocalyptic number.
It is an amenable number.
5089074832169 is a deficient number, since it is larger than the sum of its proper divisors (1).
5089074832169 is an equidigital number, since it uses as much as digits as its factorization.
5089074832169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 26127360, while the sum is 62.
The spelling of 5089074832169 in words is "five trillion, eighty-nine billion, seventy-four million, eight hundred thirty-two thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •