Base | Representation |
---|---|
bin | 11111111111110101001… |
… | …111110110001101110001 |
3 | 21210012121010202202100022 |
4 | 133333311033312031301 |
5 | 242011212233013101 |
6 | 4402045013333225 |
7 | 314601242634155 |
oct | 37776517661561 |
9 | 7705533682308 |
10 | 2198842860401 |
11 | 77858451a970 |
12 | 2b6198037215 |
13 | 12c471c17855 |
14 | 785d2ddb065 |
15 | 3c2e4a80a1b |
hex | 1fff53f6371 |
2198842860401 has 16 divisors (see below), whose sum is σ = 2400438687360. Its totient is φ = 1997531003520.
The previous prime is 2198842860353. The next prime is 2198842860413. The reversal of 2198842860401 is 1040682488912.
It is a cyclic number.
It is not a de Polignac number, because 2198842860401 - 210 = 2198842859377 is a prime.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2198842860421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 151605716 + ... + 151620218.
It is an arithmetic number, because the mean of its divisors is an integer number (150027417960).
Almost surely, 22198842860401 is an apocalyptic number.
It is an amenable number.
2198842860401 is a deficient number, since it is larger than the sum of its proper divisors (201595826959).
2198842860401 is a wasteful number, since it uses less digits than its factorization.
2198842860401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23336.
The product of its (nonzero) digits is 1769472, while the sum is 53.
The spelling of 2198842860401 in words is "two trillion, one hundred ninety-eight billion, eight hundred forty-two million, eight hundred sixty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •