Base | Representation |
---|---|
bin | 11000111111001… |
… | …011111011001101 |
3 | 1002012211102202022 |
4 | 120333023323031 |
5 | 1324304421401 |
6 | 105333135525 |
7 | 13250200202 |
oct | 3077137315 |
9 | 1065742668 |
10 | 419217101 |
11 | 1a5701016 |
12 | b848a5a5 |
13 | 68b0c574 |
14 | 3d967ca9 |
15 | 26c0c71b |
hex | 18fcbecd |
419217101 has 2 divisors, whose sum is σ = 419217102. Its totient is φ = 419217100.
The previous prime is 419217079. The next prime is 419217103. The reversal of 419217101 is 101712914.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 391644100 + 27573001 = 19790^2 + 5251^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-419217101 is a prime.
Together with 419217103, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p22305194 and since 419217101 and 22305194 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 (419217103) 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, 209608550 + 209608551.
It is an arithmetic number, because the mean of its divisors is an integer number (209608551).
Almost surely, 2419217101 is an apocalyptic number.
It is an amenable number.
419217101 is a deficient number, since it is larger than the sum of its proper divisors (1).
419217101 is an equidigital number, since it uses as much as digits as its factorization.
419217101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 26.
The square root of 419217101 is about 20474.7918426537. The cubic root of 419217101 is about 748.4216293992.
The spelling of 419217101 in words is "four hundred nineteen million, two hundred seventeen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •