Base | Representation |
---|---|
bin | 100011100011100110001… |
… | …0001000000011010001101 |
3 | 122022011200211102110221202 |
4 | 1013013030101000122031 |
5 | 1120031134013410431 |
6 | 14220544523035245 |
7 | 1013026402440626 |
oct | 107071421003215 |
9 | 18264624373852 |
10 | 4886804825741 |
11 | 1614533a1a773 |
12 | 66b11906bb25 |
13 | 295a92928207 |
14 | 12c7460b2a4d |
15 | 871b4d808cb |
hex | 471cc44068d |
4886804825741 has 2 divisors, whose sum is σ = 4886804825742. Its totient is φ = 4886804825740.
The previous prime is 4886804825719. The next prime is 4886804825797. The reversal of 4886804825741 is 1475284086884.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3626057616841 + 1260747208900 = 1904221^2 + 1122830^2 .
It is a cyclic number.
It is not a de Polignac number, because 4886804825741 - 210 = 4886804824717 is a prime.
It is a super-2 number, since 2×48868048257412 (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 (4886804825141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2443402412870 + 2443402412871.
It is an arithmetic number, because the mean of its divisors is an integer number (2443402412871).
Almost surely, 24886804825741 is an apocalyptic number.
It is an amenable number.
4886804825741 is a deficient number, since it is larger than the sum of its proper divisors (1).
4886804825741 is an equidigital number, since it uses as much as digits as its factorization.
4886804825741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 110100480, while the sum is 65.
The spelling of 4886804825741 in words is "four trillion, eight hundred eighty-six billion, eight hundred four million, eight hundred twenty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •