Base | Representation |
---|---|
bin | 1011101100011000000… |
… | …1011110001101010101 |
3 | 201012112102102111120120 |
4 | 2323012001132031111 |
5 | 11242411014122021 |
6 | 232142110222153 |
7 | 20341155241566 |
oct | 2730601361525 |
9 | 635472374516 |
10 | 200890770261 |
11 | 7821966a075 |
12 | 32b25ab4959 |
13 | 15c36a3377c |
14 | 9a1a51816d |
15 | 535b77b2c6 |
hex | 2ec605e355 |
200890770261 has 16 divisors (see below), whose sum is σ = 283861785600. Its totient is φ = 125937427968.
The previous prime is 200890770259. The next prime is 200890770263. The reversal of 200890770261 is 162077098002.
200890770261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (200890770259) and next prime (200890770263).
It is not a de Polignac number, because 200890770261 - 21 = 200890770259 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200890770263) 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 15 ways as a sum of consecutive naturals, for example, 1686901 + ... + 1802058.
It is an arithmetic number, because the mean of its divisors is an integer number (17741361600).
Almost surely, 2200890770261 is an apocalyptic number.
It is an amenable number.
200890770261 is a deficient number, since it is larger than the sum of its proper divisors (82971015339).
200890770261 is a wasteful number, since it uses less digits than its factorization.
200890770261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3490108.
The product of its (nonzero) digits is 84672, while the sum is 42.
The spelling of 200890770261 in words is "two hundred billion, eight hundred ninety million, seven hundred seventy thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •