Base | Representation |
---|---|
bin | 100000000001000011100… |
… | …001101100011001000001 |
3 | 21210022222122222100220111 |
4 | 200001003201230121001 |
5 | 242021404434132401 |
6 | 4402423210111321 |
7 | 314645630543506 |
oct | 40010341543101 |
9 | 7708878870814 |
10 | 2200156161601 |
11 | 779098882562 |
12 | 2b64a3a1b541 |
13 | 12c62102bb58 |
14 | 786b95c14ad |
15 | 3c36eeebe51 |
hex | 2004386c641 |
2200156161601 has 8 divisors (see below), whose sum is σ = 2202686123400. Its totient is φ = 2197627576320.
The previous prime is 2200156161589. The next prime is 2200156161607. The reversal of 2200156161601 is 1061616510022.
It can be written as a sum of positive squares in 4 ways, for example, as 23353952400 + 2176802209201 = 152820^2 + 1475399^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2200156161601 - 25 = 2200156161569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2200156161607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2871645 + ... + 3556213.
It is an arithmetic number, because the mean of its divisors is an integer number (275335765425).
Almost surely, 22200156161601 is an apocalyptic number.
It is an amenable number.
2200156161601 is a deficient number, since it is larger than the sum of its proper divisors (2529961799).
2200156161601 is a wasteful number, since it uses less digits than its factorization.
2200156161601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 688259.
The product of its (nonzero) digits is 4320, while the sum is 31.
The spelling of 2200156161601 in words is "two trillion, two hundred billion, one hundred fifty-six million, one hundred sixty-one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •