Base | Representation |
---|---|
bin | 111101110011… |
… | …001000010101 |
3 | 1010111001111220 |
4 | 331303020111 |
5 | 13121401323 |
6 | 1335120553 |
7 | 254461641 |
oct | 75631025 |
9 | 33431456 |
10 | 16200213 |
11 | 9165507 |
12 | 5513159 |
13 | 3482a33 |
14 | 2219c21 |
15 | 16500e3 |
hex | f73215 |
16200213 has 4 divisors (see below), whose sum is σ = 21600288. Its totient is φ = 10800140.
The previous prime is 16200209. The next prime is 16200271. The reversal of 16200213 is 31200261.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 16200213 - 22 = 16200209 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 16200192 and 16200201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16200203) 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 in 3 ways as a sum of consecutive naturals, for example, 2700033 + ... + 2700038.
It is an arithmetic number, because the mean of its divisors is an integer number (5400072).
Almost surely, 216200213 is an apocalyptic number.
It is an amenable number.
16200213 is a deficient number, since it is larger than the sum of its proper divisors (5400075).
16200213 is an equidigital number, since it uses as much as digits as its factorization.
16200213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5400074.
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 16200213 is about 4024.9488195504. The cubic root of 16200213 is about 253.0309085434.
Adding to 16200213 its reverse (31200261), we get a palindrome (47400474).
The spelling of 16200213 in words is "sixteen million, two hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •