Base | Representation |
---|---|
bin | 1011101010001100011… |
… | …0011001100000011001 |
3 | 201011000120221010122110 |
4 | 2322203012121200121 |
5 | 11240211020443121 |
6 | 232004020142533 |
7 | 20320512132141 |
oct | 2724306314031 |
9 | 634016833573 |
10 | 200304859161 |
11 | 77a48964420 |
12 | 329a1837a49 |
13 | 15b7252b904 |
14 | 99a279b921 |
15 | 53250e2d76 |
hex | 2ea3199819 |
200304859161 has 32 divisors (see below), whose sum is σ = 301640371200. Its totient is φ = 117116982080.
The previous prime is 200304859159. The next prime is 200304859163. The reversal of 200304859161 is 161958403002.
It is an interprime number because it is at equal distance from previous prime (200304859159) and next prime (200304859163).
It is a cyclic number.
It is not a de Polignac number, because 200304859161 - 21 = 200304859159 is a prime.
It is not an unprimeable number, because it can be changed into a prime (200304859163) 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 31 ways as a sum of consecutive naturals, for example, 1121740 + ... + 1287986.
It is an arithmetic number, because the mean of its divisors is an integer number (9426261600).
Almost surely, 2200304859161 is an apocalyptic number.
It is an amenable number.
200304859161 is a deficient number, since it is larger than the sum of its proper divisors (101335512039).
200304859161 is a wasteful number, since it uses less digits than its factorization.
200304859161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167549.
The product of its (nonzero) digits is 51840, while the sum is 39.
The spelling of 200304859161 in words is "two hundred billion, three hundred four million, eight hundred fifty-nine thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •