Base | Representation |
---|---|
bin | 10111111001010… |
… | …00010000010101 |
3 | 111222011112222011 |
4 | 23330220100111 |
5 | 402303133101 |
6 | 31520104221 |
7 | 4652510431 |
oct | 1374502025 |
9 | 458145864 |
10 | 200442901 |
11 | a316579a |
12 | 57165071 |
13 | 326b0a89 |
14 | 1c8999c1 |
15 | 128e5751 |
hex | bf28415 |
200442901 has 2 divisors, whose sum is σ = 200442902. Its totient is φ = 200442900.
The previous prime is 200442899. The next prime is 200442911. The reversal of 200442901 is 109244002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 179292100 + 21150801 = 13390^2 + 4599^2 .
It is a cyclic number.
It is not a de Polignac number, because 200442901 - 21 = 200442899 is a prime.
It is a super-2 number, since 2×2004429012 = 80354713122591602, which contains 22 as substring.
Together with 200442899, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200442911) 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, 100221450 + 100221451.
It is an arithmetic number, because the mean of its divisors is an integer number (100221451).
Almost surely, 2200442901 is an apocalyptic number.
It is an amenable number.
200442901 is a deficient number, since it is larger than the sum of its proper divisors (1).
200442901 is an equidigital number, since it uses as much as digits as its factorization.
200442901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
The square root of 200442901 is about 14157.7858791550. The cubic root of 200442901 is about 585.2349128391.
Adding to 200442901 its reverse (109244002), we get a palindrome (309686903).
The spelling of 200442901 in words is "two hundred million, four hundred forty-two thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •