414
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 936
- Proper Divisor Sum (Aliquot Sum)
- 522
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 132
- Möbius Function
- 0
- Radical
- 138
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 89
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- vierhundertvierzehn· ordinal: vierhundertvierzehnste
- English
- four hundred fourteen· ordinal: four hundred fourteenth
- Spanish
- cuatrocientos catorce· ordinal: 414º
- French
- quatre cent quatorze· ordinal: quatre cent quatorzième
- Italian
- quattrocentoquattordici· ordinal: 414º
- Latin
- quadringenti quattuordecim· ordinal: 414.
- Portuguese
- quatrocentos e catorze· ordinal: 414º
Appears in sequences
- Numbers k such that k^4 + 1 is prime.at n=52A000068
- Related to population of numbers of form x^2 + y^2.at n=10A000693
- Number of compositions of n into 3 ordered relatively prime parts.at n=35A000741
- Numbers beginning with letter 'f' in English.at n=38A000867
- -1 + Sum (k-1)! C(n,k), k = 1..n for n > 0, a(0) = 1.at n=6A001338
- Number of partitions of floor(5n/2) into n nonnegative integers each no more than 5.at n=14A001975
- Number of partitions of floor(5n/2)-1 into n nonnegative integers each no more than 5.at n=14A001976
- MacMahon's solid partitions of n in which 2 is the smallest summand.at n=7A002043
- Palindromes in base 10.at n=50A002113
- a(1) = 0, a(2) = 0; for n > 2, a(n) - a(n-3) - a(n-5) - ... - a(n-p) = n if n is prime, otherwise = 0, where p = largest prime < n.at n=22A002123
- Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 2.at n=65A002155
- Numbers of the form (p^2 - 49)/120 where p is prime.at n=23A002382
- Expansion of e.g.f. exp( x * exp(-x) ).at n=7A003725
- Bell numbers written backwards.at n=8A004098
- Sum of remainders of n mod k, for k = 1, 2, 3, ..., n.at n=48A004125
- a(n) = n*(n + 1)*(n^2 - 3*n + 6)/8.at n=7A004255
- a(n) = Fibonacci(n+2) + prime(n).at n=11A004399
- Primes written in base 5.at n=28A004679
- a(n) = least integer m > a(n-1) such that m - a(n-1) != a(j) - a(k) for all j, k less than n; a(1) = 1, a(2) = 2.at n=20A004978
- Start with 4; if k appears then so do 2k+2 and 3k+3. (duplicates omitted.)at n=41A005662