Base | Representation |
---|---|
bin | 11001100010001… |
… | …11100000101101 |
3 | 112221001121110201 |
4 | 30301013200231 |
5 | 414313434123 |
6 | 33131033501 |
7 | 5210455555 |
oct | 1461074055 |
9 | 487047421 |
10 | 214202413 |
11 | aaa03497 |
12 | 5b89b891 |
13 | 354ba8b9 |
14 | 2063c165 |
15 | 13c125ad |
hex | cc4782d |
214202413 has 2 divisors, whose sum is σ = 214202414. Its totient is φ = 214202412.
The previous prime is 214202411. The next prime is 214202419. The reversal of 214202413 is 314202412.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110712484 + 103489929 = 10522^2 + 10173^2 .
It is a cyclic number.
It is not a de Polignac number, because 214202413 - 21 = 214202411 is a prime.
Together with 214202411, 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 (214202411) 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, 107101206 + 107101207.
It is an arithmetic number, because the mean of its divisors is an integer number (107101207).
Almost surely, 2214202413 is an apocalyptic number.
It is an amenable number.
214202413 is a deficient number, since it is larger than the sum of its proper divisors (1).
214202413 is an equidigital number, since it uses as much as digits as its factorization.
214202413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 19.
The square root of 214202413 is about 14635.6555370779. The cubic root of 214202413 is about 598.3309289006.
Adding to 214202413 its reverse (314202412), we get a palindrome (528404825).
Subtracting 214202413 from its reverse (314202412), we obtain a palindrome (99999999).
The spelling of 214202413 in words is "two hundred fourteen million, two hundred two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •