419
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 420
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 418
- Möbius Function
- -1
- Radical
- 419
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 40
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- yes
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 81
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- vierhundertneunzehn· ordinal: vierhundertneunzehnste
- English
- four hundred nineteen· ordinal: four hundred nineteenth
- Spanish
- cuatrocientos diecinueve· ordinal: 419º
- French
- quatre cent dix-neuf· ordinal: quatre cent dix-neufième
- Italian
- quattrocentodiciannove· ordinal: 419º
- Latin
- quadringenti undeviginti· ordinal: 419.
- Portuguese
- quatrocentos e dezenove· ordinal: 419º
Appears in sequences
- a(n) = floor(n^(3/2)).at n=56A000093
- Numbers beginning with letter 'f' in English.at n=43A000867
- Twin primes.at n=41A001097
- A continued fraction.at n=8A001112
- Primes with primitive root 2.at n=32A001122
- Lesser of twin primes.at n=21A001359
- Numbers k such that phi(k+2) = phi(k) + 2.at n=35A001838
- The coding-theoretic function A(n,4,4).at n=19A001843
- Full reptend primes: primes with primitive root 10.at n=29A001913
- Primes p such that the congruence 2^x == 3 (mod p) is solvable.at n=47A001915
- Primes p such that the congruence 2^x = 5 (mod p) is solvable.at n=44A001916
- Number of partitions of n into parts 2, 3, 4, 5, 6, 7.at n=35A001996
- Prime determinants of forms with class number 2.at n=37A002052
- From a Goldbach conjecture: records in A185091.at n=13A002092
- Primes of the form 4*k + 3.at n=40A002145
- Smallest prime p==3 (mod 8) such that Q(sqrt(-p)) has class number 2n+1.at n=4A002148
- Primes of the form k^2 - k - 1.at n=13A002327
- Numbers k such that binomial(2*k,k) is divisible by (k+1)^2.at n=35A002503
- Lucasian primes: p == 3 (mod 4) with 2*p+1 prime.at n=10A002515
- Numbers k such that (k^2 + k + 1)/13 is prime.at n=21A002642