Base | Representation |
---|---|
bin | 1100001110101101011… |
… | …01101000001110001001 |
3 | 1111011122102222201021122 |
4 | 12013112231220032021 |
5 | 23341044303110121 |
6 | 521013234445025 |
7 | 42234204012353 |
oct | 6072655501611 |
9 | 1434572881248 |
10 | 420214113161 |
11 | 152236a03847 |
12 | 69534a33775 |
13 | 3081a4a204b |
14 | 164a4aa20d3 |
15 | ade635a5ab |
hex | 61d6b68389 |
420214113161 has 2 divisors, whose sum is σ = 420214113162. Its totient is φ = 420214113160.
The previous prime is 420214113139. The next prime is 420214113173. The reversal of 420214113161 is 161311412024.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 259545415936 + 160668697225 = 509456^2 + 400835^2 .
It is a cyclic number.
It is not a de Polignac number, because 420214113161 - 226 = 420147004297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 420214113161.
It is not a weakly prime, because it can be changed into another prime (420214113061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 210107056580 + 210107056581.
It is an arithmetic number, because the mean of its divisors is an integer number (210107056581).
Almost surely, 2420214113161 is an apocalyptic number.
It is an amenable number.
420214113161 is a deficient number, since it is larger than the sum of its proper divisors (1).
420214113161 is an equidigital number, since it uses as much as digits as its factorization.
420214113161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 420214113161 its reverse (161311412024), we get a palindrome (581525525185).
The spelling of 420214113161 in words is "four hundred twenty billion, two hundred fourteen million, one hundred thirteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •