Base | Representation |
---|---|
bin | 1011101101001100110… |
… | …11100110010110001101 |
3 | 1102110012200211000100122 |
4 | 11312212123212112031 |
5 | 23042223344230331 |
6 | 504440152434325 |
7 | 41026330246121 |
oct | 5664633462615 |
9 | 1373180730318 |
10 | 402224211341 |
11 | 145645099297 |
12 | 65b540a89a5 |
13 | 2bc11398c24 |
14 | 15679743581 |
15 | a6e1ce917b |
hex | 5da66e658d |
402224211341 has 2 divisors, whose sum is σ = 402224211342. Its totient is φ = 402224211340.
The previous prime is 402224211271. The next prime is 402224211343. The reversal of 402224211341 is 143112422204.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 392333113225 + 9891098116 = 626365^2 + 99454^2 .
It is a cyclic number.
It is not a de Polignac number, because 402224211341 - 234 = 385044342157 is a prime.
Together with 402224211343, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 402224211341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (402224211343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 201112105670 + 201112105671.
It is an arithmetic number, because the mean of its divisors is an integer number (201112105671).
Almost surely, 2402224211341 is an apocalyptic number.
It is an amenable number.
402224211341 is a deficient number, since it is larger than the sum of its proper divisors (1).
402224211341 is an equidigital number, since it uses as much as digits as its factorization.
402224211341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3072, while the sum is 26.
Adding to 402224211341 its reverse (143112422204), we get a palindrome (545336633545).
The spelling of 402224211341 in words is "four hundred two billion, two hundred twenty-four million, two hundred eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •