Base | Representation |
---|---|
bin | 100100000101011010101… |
… | …1110000010010011110101 |
3 | 122120010011200022112201212 |
4 | 1020022311132002103311 |
5 | 1122223411310400321 |
6 | 14314200034331205 |
7 | 1021210316221331 |
oct | 110126536022365 |
9 | 18503150275655 |
10 | 4959436809461 |
11 | 16423158720a2 |
12 | 681209429b05 |
13 | 29c899433684 |
14 | 1320764947c1 |
15 | 8901658d55b |
hex | 482b57824f5 |
4959436809461 has 2 divisors, whose sum is σ = 4959436809462. Its totient is φ = 4959436809460.
The previous prime is 4959436809443. The next prime is 4959436809517. The reversal of 4959436809461 is 1649086349594.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4872835502500 + 86601306961 = 2207450^2 + 294281^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4959436809461 is a prime.
It is a super-2 number, since 2×49594368094612 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4959436809391 and 4959436809400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4959436809161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2479718404730 + 2479718404731.
It is an arithmetic number, because the mean of its divisors is an integer number (2479718404731).
Almost surely, 24959436809461 is an apocalyptic number.
It is an amenable number.
4959436809461 is a deficient number, since it is larger than the sum of its proper divisors (1).
4959436809461 is an equidigital number, since it uses as much as digits as its factorization.
4959436809461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 201553920, while the sum is 68.
The spelling of 4959436809461 in words is "four trillion, nine hundred fifty-nine billion, four hundred thirty-six million, eight hundred nine thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •