Base | Representation |
---|---|
bin | 100100001101001011011… |
… | …0101101110100100011101 |
3 | 122121201012011022100200212 |
4 | 1020122112311232210131 |
5 | 1123012024303424144 |
6 | 14325553504302205 |
7 | 1022340315606134 |
oct | 110322665564435 |
9 | 18551164270625 |
10 | 4976102795549 |
11 | 1649398335116 |
12 | 68449a911965 |
13 | 2a1324179cc2 |
14 | 132bb7a6891b |
15 | 8968e78849e |
hex | 48696d6e91d |
4976102795549 has 2 divisors, whose sum is σ = 4976102795550. Its totient is φ = 4976102795548.
The previous prime is 4976102795483. The next prime is 4976102795551. The reversal of 4976102795549 is 9455972016794.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4976102795524 + 25 = 2230718^2 + 5^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4976102795549 is a prime.
It is a super-2 number, since 2×49761027955492 (a number of 26 digits) contains 22 as substring.
Together with 4976102795551, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4976102795569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2488051397774 + 2488051397775.
It is an arithmetic number, because the mean of its divisors is an integer number (2488051397775).
Almost surely, 24976102795549 is an apocalyptic number.
It is an amenable number.
4976102795549 is a deficient number, since it is larger than the sum of its proper divisors (1).
4976102795549 is an equidigital number, since it uses as much as digits as its factorization.
4976102795549 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 171460800, while the sum is 68.
The spelling of 4976102795549 in words is "four trillion, nine hundred seventy-six billion, one hundred two million, seven hundred ninety-five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •