Base | Representation |
---|---|
bin | 10111110111100… |
… | …01111010100001 |
3 | 111221202020122110 |
4 | 23323301322201 |
5 | 402224022241 |
6 | 31511225533 |
7 | 4650562500 |
oct | 1373617241 |
9 | 457666573 |
10 | 200220321 |
11 | a3023544 |
12 | 570782a9 |
13 | 32633682 |
14 | 1c83c837 |
15 | 1289e816 |
hex | bef1ea1 |
200220321 has 48 divisors (see below), whose sum is σ = 326514240. Its totient is φ = 108662400.
The previous prime is 200220287. The next prime is 200220353. The reversal of 200220321 is 123022002.
It is not a de Polignac number, because 200220321 - 226 = 133111457 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200220297 and 200220306.
It is not an unprimeable number, because it can be changed into a prime (200220121) 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 47 ways as a sum of consecutive naturals, for example, 285271 + ... + 285971.
It is an arithmetic number, because the mean of its divisors is an integer number (6802380).
Almost surely, 2200220321 is an apocalyptic number.
200220321 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
200220321 is a deficient number, since it is larger than the sum of its proper divisors (126293919).
200220321 is a wasteful number, since it uses less digits than its factorization.
200220321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 814 (or 807 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 200220321 is about 14149.9230033241. The cubic root of 200220321 is about 585.0182096750.
Adding to 200220321 its reverse (123022002), we get a palindrome (323242323).
The spelling of 200220321 in words is "two hundred million, two hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •