Base | Representation |
---|---|
bin | 100101100010111100111… |
… | …0010001011001110110101 |
3 | 200021022122002210220222011 |
4 | 1023011321302023032311 |
5 | 1134021243010400322 |
6 | 14550335242404221 |
7 | 1041551006042626 |
oct | 113057162131665 |
9 | 20238562726864 |
10 | 5160298918837 |
11 | 170a51a235887 |
12 | 6b4125800671 |
13 | 2b57ca24082a |
14 | 13ba8cc6ba4d |
15 | 8e370557677 |
hex | 4b179c8b3b5 |
5160298918837 has 2 divisors, whose sum is σ = 5160298918838. Its totient is φ = 5160298918836.
The previous prime is 5160298918813. The next prime is 5160298918877. The reversal of 5160298918837 is 7388198920615.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4085415180081 + 1074883738756 = 2021241^2 + 1036766^2 .
It is a cyclic number.
It is not a de Polignac number, because 5160298918837 - 235 = 5125939180469 is a prime.
It is a super-2 number, since 2×51602989188372 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5160298918877) 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, 2580149459418 + 2580149459419.
It is an arithmetic number, because the mean of its divisors is an integer number (2580149459419).
Almost surely, 25160298918837 is an apocalyptic number.
It is an amenable number.
5160298918837 is a deficient number, since it is larger than the sum of its proper divisors (1).
5160298918837 is an equidigital number, since it uses as much as digits as its factorization.
5160298918837 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52254720, while the sum is 67.
The spelling of 5160298918837 in words is "five trillion, one hundred sixty billion, two hundred ninety-eight million, nine hundred eighteen thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •