Base | Representation |
---|---|
bin | 1011101101001011011… |
… | …10010100000111111101 |
3 | 1102110011212110220020112 |
4 | 11312211232110013331 |
5 | 23042212324341341 |
6 | 504435050155405 |
7 | 41026124324336 |
oct | 5664556240775 |
9 | 1373155426215 |
10 | 402212340221 |
11 | 14563942034a |
12 | 65b50122b65 |
13 | 2bc0baa07b3 |
14 | 15677d3328d |
15 | a6e0c51aeb |
hex | 5da5b941fd |
402212340221 has 2 divisors, whose sum is σ = 402212340222. Its totient is φ = 402212340220.
The previous prime is 402212340217. The next prime is 402212340223. The reversal of 402212340221 is 122043212204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 387574728025 + 14637612196 = 622555^2 + 120986^2 .
It is a cyclic number.
It is not a de Polignac number, because 402212340221 - 22 = 402212340217 is a prime.
Together with 402212340223, 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 (402212340223) 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, 201106170110 + 201106170111.
It is an arithmetic number, because the mean of its divisors is an integer number (201106170111).
Almost surely, 2402212340221 is an apocalyptic number.
It is an amenable number.
402212340221 is a deficient number, since it is larger than the sum of its proper divisors (1).
402212340221 is an equidigital number, since it uses as much as digits as its factorization.
402212340221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 402212340221 its reverse (122043212204), we get a palindrome (524255552425).
The spelling of 402212340221 in words is "four hundred two billion, two hundred twelve million, three hundred forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •