Base | Representation |
---|---|
bin | 1011101011100000011… |
… | …0101101001010100101 |
3 | 201011221011001000101121 |
4 | 2322320012231022211 |
5 | 11241421224324341 |
6 | 232103005253541 |
7 | 20332321402324 |
oct | 2727006551245 |
9 | 634834030347 |
10 | 200657261221 |
11 | 7810987a29a |
12 | 32a7b8642b1 |
13 | 15bca546241 |
14 | 99d74d20bb |
15 | 53460034d1 |
hex | 2eb81ad2a5 |
200657261221 has 8 divisors (see below), whose sum is σ = 201147919488. Its totient is φ = 200166720000.
The previous prime is 200657261201. The next prime is 200657261237. The reversal of 200657261221 is 122162756002.
200657261221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 200657261221 - 221 = 200655164069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200657261201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4113786 + ... + 4162276.
It is an arithmetic number, because the mean of its divisors is an integer number (25143489936).
Almost surely, 2200657261221 is an apocalyptic number.
It is an amenable number.
200657261221 is a deficient number, since it is larger than the sum of its proper divisors (490658267).
200657261221 is an equidigital number, since it uses as much as digits as its factorization.
200657261221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58523.
The product of its (nonzero) digits is 20160, while the sum is 34.
The spelling of 200657261221 in words is "two hundred billion, six hundred fifty-seven million, two hundred sixty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •