Base | Representation |
---|---|
bin | 10111110110101… |
… | …01000000100001 |
3 | 111221112020020021 |
4 | 23323111000201 |
5 | 402211230141 |
6 | 31504513441 |
7 | 4646560345 |
oct | 1373250041 |
9 | 457466207 |
10 | 200101921 |
11 | a2a52598 |
12 | 5701b881 |
13 | 325c1806 |
14 | 1c80b625 |
15 | 128796d1 |
hex | bed5021 |
200101921 has 2 divisors, whose sum is σ = 200101922. Its totient is φ = 200101920.
The previous prime is 200101879. The next prime is 200101963. The reversal of 200101921 is 129101002.
It is a balanced prime because it is at equal distance from previous prime (200101879) and next prime (200101963).
It can be written as a sum of positive squares in only one way, i.e., 187991521 + 12110400 = 13711^2 + 3480^2 .
It is a cyclic number.
It is not a de Polignac number, because 200101921 - 29 = 200101409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200101895 and 200101904.
It is not a weakly prime, because it can be changed into another prime (200161921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100050960 + 100050961.
It is an arithmetic number, because the mean of its divisors is an integer number (100050961).
Almost surely, 2200101921 is an apocalyptic number.
It is an amenable number.
200101921 is a deficient number, since it is larger than the sum of its proper divisors (1).
200101921 is an equidigital number, since it uses as much as digits as its factorization.
200101921 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 16.
The square root of 200101921 is about 14145.7386162759. The cubic root of 200101921 is about 584.9028703767.
Adding to 200101921 its reverse (129101002), we get a palindrome (329202923).
The spelling of 200101921 in words is "two hundred million, one hundred one thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •