Base | Representation |
---|---|
bin | 100101001000000111011… |
… | …1011000011110011011111 |
3 | 200001210212221200021110112 |
4 | 1022100032323003303133 |
5 | 1132100232401321001 |
6 | 14504045051200235 |
7 | 1034440646126543 |
oct | 112201673036337 |
9 | 20053787607415 |
10 | 5102671510751 |
11 | 1698038050191 |
12 | 6a4b2244607b |
13 | 2b02451c3ca9 |
14 | 138d83541a23 |
15 | 8caeb264cbb |
hex | 4a40eec3cdf |
5102671510751 has 2 divisors, whose sum is σ = 5102671510752. Its totient is φ = 5102671510750.
The previous prime is 5102671510733. The next prime is 5102671510757. The reversal of 5102671510751 is 1570151762015.
5102671510751 is digitally balanced in base 3, 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 5102671510751 - 222 = 5102667316447 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5102671510699 and 5102671510708.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5102671510757) 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, 2551335755375 + 2551335755376.
It is an arithmetic number, because the mean of its divisors is an integer number (2551335755376).
Almost surely, 25102671510751 is an apocalyptic number.
5102671510751 is a deficient number, since it is larger than the sum of its proper divisors (1).
5102671510751 is an equidigital number, since it uses as much as digits as its factorization.
5102671510751 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 73500, while the sum is 41.
The spelling of 5102671510751 in words is "five trillion, one hundred two billion, six hundred seventy-one million, five hundred ten thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •