Base | Representation |
---|---|
bin | 100100110110111000110… |
… | …1010011001001111100101 |
3 | 122221021101111011112120121 |
4 | 1021231301222121033211 |
5 | 1130443444341141322 |
6 | 14435045505001541 |
7 | 1031661052200556 |
oct | 111556152311745 |
9 | 18837344145517 |
10 | 5065673380837 |
11 | 168338161a613 |
12 | 6999179232b1 |
13 | 2a98ca02c224 |
14 | 13727390632d |
15 | 8bb83090ec7 |
hex | 49b71a993e5 |
5065673380837 has 2 divisors, whose sum is σ = 5065673380838. Its totient is φ = 5065673380836.
The previous prime is 5065673380811. The next prime is 5065673380871. The reversal of 5065673380837 is 7380833765605.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4661341452196 + 404331928641 = 2159014^2 + 635871^2 .
It is a cyclic number.
It is not a de Polignac number, because 5065673380837 - 27 = 5065673380709 is a prime.
It is a super-2 number, since 2×50656733808372 (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 (5065673380637) 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, 2532836690418 + 2532836690419.
It is an arithmetic number, because the mean of its divisors is an integer number (2532836690419).
Almost surely, 25065673380837 is an apocalyptic number.
It is an amenable number.
5065673380837 is a deficient number, since it is larger than the sum of its proper divisors (1).
5065673380837 is an equidigital number, since it uses as much as digits as its factorization.
5065673380837 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 76204800, while the sum is 61.
The spelling of 5065673380837 in words is "five trillion, sixty-five billion, six hundred seventy-three million, three hundred eighty thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •