Base | Representation |
---|---|
bin | 1011101010010010000… |
… | …1100010100111001001 |
3 | 201011002020212222212011 |
4 | 2322210201202213021 |
5 | 11240233130022221 |
6 | 232010232215521 |
7 | 20321222202241 |
oct | 2724441424711 |
9 | 634066788764 |
10 | 200328751561 |
11 | 77a603a3104 |
12 | 329a983a5a1 |
13 | 15b77475923 |
14 | 99a5a1ab21 |
15 | 53272621e1 |
hex | 2ea48629c9 |
200328751561 has 27 divisors (see below), whose sum is σ = 208960117639. Its totient is φ = 192051636128.
The previous prime is 200328751559. The next prime is 200328751577. The reversal of 200328751561 is 165157823002.
The square root of 200328751561 is 447581.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 38467369161 + 161861382400 = 196131^2 + 402320^2 .
It is not a de Polignac number, because 200328751561 - 21 = 200328751559 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200322751561) 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 26 ways as a sum of consecutive naturals, for example, 1872231270 + ... + 1872231376.
Almost surely, 2200328751561 is an apocalyptic number.
200328751561 is the 447581-st square number.
200328751561 is the 223791-st centered octagonal number.
It is an amenable number.
200328751561 is a deficient number, since it is larger than the sum of its proper divisors (8631366078).
200328751561 is an frugal number, since it uses more digits than its factorization.
200328751561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486 (or 243 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 40.
The spelling of 200328751561 in words is "two hundred billion, three hundred twenty-eight million, seven hundred fifty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •