Base | Representation |
---|---|
bin | 11000101100000… |
… | …011100100011101 |
3 | 1001212101122112001 |
4 | 120230003210131 |
5 | 1322013432031 |
6 | 105033442301 |
7 | 13156442263 |
oct | 3054034435 |
9 | 1055348461 |
10 | 414202141 |
11 | 1a2896221 |
12 | b6870391 |
13 | 67a74a32 |
14 | 3d020433 |
15 | 2656b861 |
hex | 18b0391d |
414202141 has 2 divisors, whose sum is σ = 414202142. Its totient is φ = 414202140.
The previous prime is 414202039. The next prime is 414202169. The reversal of 414202141 is 141202414.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 398162116 + 16040025 = 19954^2 + 4005^2 .
It is a cyclic number.
It is not a de Polignac number, because 414202141 - 29 = 414201629 is a prime.
It is equal to p22052620 and since 414202141 and 22052620 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (414202441) 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, 207101070 + 207101071.
It is an arithmetic number, because the mean of its divisors is an integer number (207101071).
Almost surely, 2414202141 is an apocalyptic number.
It is an amenable number.
414202141 is a deficient number, since it is larger than the sum of its proper divisors (1).
414202141 is an equidigital number, since it uses as much as digits as its factorization.
414202141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
The square root of 414202141 is about 20351.9566872574. The cubic root of 414202141 is about 745.4252731601.
Adding to 414202141 its reverse (141202414), we get a palindrome (555404555).
The spelling of 414202141 in words is "four hundred fourteen million, two hundred two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •