Base | Representation |
---|---|
bin | 100011100000001101110… |
… | …0110110110110010100101 |
3 | 122021110221221200220000221 |
4 | 1013000123212312302211 |
5 | 1114421302240101411 |
6 | 14213344341404341 |
7 | 1012351461546664 |
oct | 107003346666245 |
9 | 18243857626027 |
10 | 4879546018981 |
11 | 1611449577817 |
12 | 6698321096b1 |
13 | 2951a6b1819a |
14 | 12c258026ddb |
15 | 86ddc993071 |
hex | 4701b9b6ca5 |
4879546018981 has 2 divisors, whose sum is σ = 4879546018982. Its totient is φ = 4879546018980.
The previous prime is 4879546018889. The next prime is 4879546018999. The reversal of 4879546018981 is 1898106459784.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3109491390625 + 1770054628356 = 1763375^2 + 1330434^2 .
It is a cyclic number.
It is not a de Polignac number, because 4879546018981 - 213 = 4879546010789 is a prime.
It is a super-2 number, since 2×48795460189812 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4879546018981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4879546012981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2439773009490 + 2439773009491.
It is an arithmetic number, because the mean of its divisors is an integer number (2439773009491).
Almost surely, 24879546018981 is an apocalyptic number.
It is an amenable number.
4879546018981 is a deficient number, since it is larger than the sum of its proper divisors (1).
4879546018981 is an equidigital number, since it uses as much as digits as its factorization.
4879546018981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139345920, while the sum is 70.
The spelling of 4879546018981 in words is "four trillion, eight hundred seventy-nine billion, five hundred forty-six million, eighteen thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •