Base | Representation |
---|---|
bin | 1000001100100010… |
… | …0000001101110001 |
3 | 12200022202211112222 |
4 | 2003020200031301 |
5 | 14001202410101 |
6 | 1002150330425 |
7 | 105343032422 |
oct | 20310401561 |
9 | 5608684488 |
10 | 2200044401 |
11 | a2995aa15 |
12 | 514959a15 |
13 | 290a48929 |
14 | 16c28d649 |
15 | cd22a01b |
hex | 83220371 |
2200044401 has 2 divisors, whose sum is σ = 2200044402. Its totient is φ = 2200044400.
The previous prime is 2200044331. The next prime is 2200044419. The reversal of 2200044401 is 1044400022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2125671025 + 74373376 = 46105^2 + 8624^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2200044401 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2200044401.
It is not a weakly prime, because it can be changed into another prime (2200044421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100022200 + 1100022201.
It is an arithmetic number, because the mean of its divisors is an integer number (1100022201).
Almost surely, 22200044401 is an apocalyptic number.
It is an amenable number.
2200044401 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200044401 is an equidigital number, since it uses as much as digits as its factorization.
2200044401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 17.
The square root of 2200044401 is about 46904.6309120965. The cubic root of 2200044401 is about 1300.6001964230.
Adding to 2200044401 its reverse (1044400022), we get a palindrome (3244444423).
The spelling of 2200044401 in words is "two billion, two hundred million, forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •