Base | Representation |
---|---|
bin | 11111001101001000001… |
… | …101100101001000001000 |
3 | 21121000001221022001122001 |
4 | 133031020031211020020 |
5 | 240113212422401300 |
6 | 4321042430240344 |
7 | 310633143645256 |
oct | 37151015451010 |
9 | 7530057261561 |
10 | 2144400200200 |
11 | 757487010515 |
12 | 2a77233560b4 |
13 | 1272a692950b |
14 | 75b0a6495d6 |
15 | 3abaa17716a |
hex | 1f348365208 |
2144400200200 has 48 divisors (see below), whose sum is σ = 4985900028180. Its totient is φ = 857730908160.
The previous prime is 2144400200147. The next prime is 2144400200209. The reversal of 2144400200200 is 20020044412.
It can be written as a sum of positive squares in 6 ways, for example, as 250622386884 + 1893777813316 = 500622^2 + 1376146^2 .
It is not an unprimeable number, because it can be changed into a prime (2144400200209) 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 in 11 ways as a sum of consecutive naturals, for example, 6285204 + ... + 6617596.
Almost surely, 22144400200200 is an apocalyptic number.
2144400200200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2144400200200 is an abundant number, since it is smaller than the sum of its proper divisors (2841499827980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2144400200200 is a wasteful number, since it uses less digits than its factorization.
2144400200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 364666 (or 364657 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 19.
Adding to 2144400200200 its reverse (20020044412), we get a palindrome (2164420244612).
The spelling of 2144400200200 in words is "two trillion, one hundred forty-four billion, four hundred million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •