Base | Representation |
---|---|
bin | 1011101010010000101… |
… | …1101011100110010001 |
3 | 201011001212002212021121 |
4 | 2322210023223212101 |
5 | 11240230143134301 |
6 | 232005505322241 |
7 | 20321122404532 |
oct | 2724413534621 |
9 | 634055085247 |
10 | 200323021201 |
11 | 77a58139876 |
12 | 329a7936381 |
13 | 15b7621a594 |
14 | 99a4d68689 |
15 | 53269ce3a1 |
hex | 2ea42eb991 |
200323021201 has 2 divisors, whose sum is σ = 200323021202. Its totient is φ = 200323021200.
The previous prime is 200323021181. The next prime is 200323021211. The reversal of 200323021201 is 102120323002.
200323021201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 186727694400 + 13595326801 = 432120^2 + 116599^2 .
It is a cyclic number.
It is not a de Polignac number, because 200323021201 - 25 = 200323021169 is a prime.
It is not a weakly prime, because it can be changed into another prime (200323021211) 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 as a sum of consecutive naturals, namely, 100161510600 + 100161510601.
It is an arithmetic number, because the mean of its divisors is an integer number (100161510601).
Almost surely, 2200323021201 is an apocalyptic number.
It is an amenable number.
200323021201 is a deficient number, since it is larger than the sum of its proper divisors (1).
200323021201 is an equidigital number, since it uses as much as digits as its factorization.
200323021201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 200323021201 its reverse (102120323002), we get a palindrome (302443344203).
The spelling of 200323021201 in words is "two hundred billion, three hundred twenty-three million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •