Base | Representation |
---|---|
bin | 1100001111000110101… |
… | …1110011111110100101 |
3 | 202002121010021020110012 |
4 | 3003301223303332211 |
5 | 11421004041134412 |
6 | 240323130540005 |
7 | 21121164632213 |
oct | 3036153637645 |
9 | 662533236405 |
10 | 210213224357 |
11 | 81172980894 |
12 | 348a7b97605 |
13 | 16a91243cb6 |
14 | a2626a9cb3 |
15 | 5704deec22 |
hex | 30f1af3fa5 |
210213224357 has 2 divisors, whose sum is σ = 210213224358. Its totient is φ = 210213224356.
The previous prime is 210213224261. The next prime is 210213224359. The reversal of 210213224357 is 753422312012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 171370332961 + 38842891396 = 413969^2 + 197086^2 .
It is a cyclic number.
It is not a de Polignac number, because 210213224357 - 226 = 210146115493 is a prime.
Together with 210213224359, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210213224359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105106612178 + 105106612179.
It is an arithmetic number, because the mean of its divisors is an integer number (105106612179).
Almost surely, 2210213224357 is an apocalyptic number.
It is an amenable number.
210213224357 is a deficient number, since it is larger than the sum of its proper divisors (1).
210213224357 is an equidigital number, since it uses as much as digits as its factorization.
210213224357 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 32.
Adding to 210213224357 its reverse (753422312012), we get a palindrome (963635536369).
The spelling of 210213224357 in words is "two hundred ten billion, two hundred thirteen million, two hundred twenty-four thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •