Base | Representation |
---|---|
bin | 11111111111000101101… |
… | …000000111010110001001 |
3 | 21210010112110102011012020 |
4 | 133333011220013112021 |
5 | 242003043220300112 |
6 | 4401433433235053 |
7 | 314542402004202 |
oct | 37770550072611 |
9 | 7703473364166 |
10 | 2198043915657 |
11 | 77820453a957 |
12 | 2b5bb4562a89 |
13 | 12c375544095 |
14 | 78558c685a9 |
15 | 3c29986648c |
hex | 1ffc5a07589 |
2198043915657 has 16 divisors (see below), whose sum is σ = 3103173027072. Its totient is φ = 1379141607680.
The previous prime is 2198043915653. The next prime is 2198043915791. The reversal of 2198043915657 is 7565193408912.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 2198043915657 - 22 = 2198043915653 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2198043915657.
It is not an unprimeable number, because it can be changed into a prime (2198043915653) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3001807 + ... + 3661547.
It is an arithmetic number, because the mean of its divisors is an integer number (193948314192).
It is a 1-persistent number, because it is pandigital, but 2⋅2198043915657 = 4396087831314 is not.
Almost surely, 22198043915657 is an apocalyptic number.
It is an amenable number.
2198043915657 is a deficient number, since it is larger than the sum of its proper divisors (905129111415).
2198043915657 is a wasteful number, since it uses less digits than its factorization.
2198043915657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725088.
The product of its (nonzero) digits is 16329600, while the sum is 60.
The spelling of 2198043915657 in words is "two trillion, one hundred ninety-eight billion, forty-three million, nine hundred fifteen thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •