Base | Representation |
---|---|
bin | 100100001101001100100… |
… | …1100111001110000001101 |
3 | 122121201021220212202020001 |
4 | 1020122121030321300031 |
5 | 1123012114430100401 |
6 | 14330001441524301 |
7 | 1022341306502161 |
oct | 110323114716015 |
9 | 18551256782201 |
10 | 4976142425101 |
11 | 1649408742411 |
12 | 6844b0043691 |
13 | 2a132c444043 |
14 | 132bbd022ca1 |
15 | 89692eb5601 |
hex | 48699339c0d |
4976142425101 has 2 divisors, whose sum is σ = 4976142425102. Its totient is φ = 4976142425100.
The previous prime is 4976142425047. The next prime is 4976142425159. The reversal of 4976142425101 is 1015242416794.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3219189524100 + 1756952901001 = 1794210^2 + 1325501^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4976142425101 is a prime.
It is a super-2 number, since 2×49761424251012 (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 (4976142429101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2488071212550 + 2488071212551.
It is an arithmetic number, because the mean of its divisors is an integer number (2488071212551).
Almost surely, 24976142425101 is an apocalyptic number.
It is an amenable number.
4976142425101 is a deficient number, since it is larger than the sum of its proper divisors (1).
4976142425101 is an equidigital number, since it uses as much as digits as its factorization.
4976142425101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 483840, while the sum is 46.
The spelling of 4976142425101 in words is "four trillion, nine hundred seventy-six billion, one hundred forty-two million, four hundred twenty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •