Base | Representation |
---|---|
bin | 100011000101100000101… |
… | …1001111110000011010001 |
3 | 122001222221021111121020000 |
4 | 1012023001121332003101 |
5 | 1113001330204212221 |
6 | 14131142013040213 |
7 | 1005251364455130 |
oct | 106130131760321 |
9 | 18058837447200 |
10 | 4822198116561 |
11 | 159a0a0138941 |
12 | 65a6a8486069 |
13 | 28c967972007 |
14 | 129577897917 |
15 | 85682eb1e26 |
hex | 462c167e0d1 |
4822198116561 has 80 divisors (see below), whose sum is σ = 8267267965440. Its totient is φ = 2743950867840.
The previous prime is 4822198116503. The next prime is 4822198116577. The reversal of 4822198116561 is 1656118912284.
4822198116561 is a `hidden beast` number, since 48 + 2 + 21 + 9 + 8 + 1 + 16 + 561 = 666.
It is not a de Polignac number, because 4822198116561 - 26 = 4822198116497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4822198116498 and 4822198116507.
It is not an unprimeable number, because it can be changed into a prime (4822198116581) 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 in 79 ways as a sum of consecutive naturals, for example, 343723695 + ... + 343737723.
It is an arithmetic number, because the mean of its divisors is an integer number (103340849568).
Almost surely, 24822198116561 is an apocalyptic number.
It is an amenable number.
4822198116561 is a deficient number, since it is larger than the sum of its proper divisors (3445069848879).
4822198116561 is a wasteful number, since it uses less digits than its factorization.
4822198116561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16556 (or 16547 counting only the distinct ones).
The product of its digits is 1658880, while the sum is 54.
The spelling of 4822198116561 in words is "four trillion, eight hundred twenty-two billion, one hundred ninety-eight million, one hundred sixteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •