Base | Representation |
---|---|
bin | 10111111001000… |
… | …00111101011101 |
3 | 111222010000222111 |
4 | 23330200331131 |
5 | 402301204041 |
6 | 31515314021 |
7 | 4652324344 |
oct | 1374407535 |
9 | 458100874 |
10 | 200413021 |
11 | a31452a6 |
12 | 5714b911 |
13 | 326a02b3 |
14 | 1c88cb5b |
15 | 128db981 |
hex | bf20f5d |
200413021 has 2 divisors, whose sum is σ = 200413022. Its totient is φ = 200413020.
The previous prime is 200413019. The next prime is 200413027. The reversal of 200413021 is 120314002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 182655225 + 17757796 = 13515^2 + 4214^2 .
It is a cyclic number.
It is not a de Polignac number, because 200413021 - 21 = 200413019 is a prime.
Together with 200413019, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 200412992 and 200413010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200413027) 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 as a sum of consecutive naturals, namely, 100206510 + 100206511.
It is an arithmetic number, because the mean of its divisors is an integer number (100206511).
Almost surely, 2200413021 is an apocalyptic number.
It is an amenable number.
200413021 is a deficient number, since it is larger than the sum of its proper divisors (1).
200413021 is an equidigital number, since it uses as much as digits as its factorization.
200413021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 200413021 is about 14156.7305900762. The cubic root of 200413021 is about 585.2058310938.
Adding to 200413021 its reverse (120314002), we get a palindrome (320727023).
The spelling of 200413021 in words is "two hundred million, four hundred thirteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •