314
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 474
- Proper Divisor Sum (Aliquot Sum)
- 160
- 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
- 156
- Möbius Function
- 1
- Radical
- 314
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 37
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- dreihundertvierzehn· ordinal: dreihundertvierzehnste
- English
- three hundred fourteen· ordinal: three hundred fourteenth
- Spanish
- trescientos catorce· ordinal: 314º
- French
- trois cent quatorze· ordinal: trois cent quatorzième
- Italian
- trecentoquattordici· ordinal: 314º
- Latin
- trecenti quattuordecim· ordinal: 314.
- Portuguese
- trezentos e catorze· ordinal: 314º
Appears in sequences
- First occurrence of n consecutive numbers that take same number of steps to reach 1 in 3x+1 problem.at n=3A000546
- Expansion of 1/((1-x)^2*(1-x^2)*(1-x^3)).at n=19A000601
- Powers of 2 written in base 9.at n=8A001357
- Numbers k such that phi(k) = phi(k+2).at n=11A001494
- Nearest integer to 2*n*log(n).at n=42A001618
- 2 together with primes multiplied by 2.at n=37A001747
- Expansion of 1/((1+x)*(1-x)^7).at n=5A001769
- Squares written in base 9.at n=15A002442
- Numbers k such that binomial(2*k,k) is divisible by (k+1)^2.at n=28A002503
- Numbers k such that (4*k^2 + 1)/5 is prime.at n=50A002732
- a(n) = Sum_{d|n, d <= 4} d^2 + 4*Sum_{d|n, d>4} d.at n=56A002791
- Numbers k such that 4*k^2 + 9 is prime.at n=57A002970
- a(n) (n>6) is least integer > a(n-1) with precisely three representations a(n) = a(i) + a(j), 1 <= i < j < n, a(n) = n for n=1..6.at n=60A003045
- Numbers that are the sum of 3 positive cubes.at n=41A003072
- Number of key permutations of length n: permutations {a_i} with |a_i - a_{i-1}| = 1 or 2.at n=11A003274
- Binary entropy function: a(1)=0; for n > 1, a(n) = n + min { a(k)+a(n-k) : 1 <= k <= n-1 }.at n=53A003314
- Numbers that are the sum of 10 positive 5th powers.at n=12A003355
- Values of m in the discriminant D = -4*m leading to a new maximum of the L-function of the Dirichlet series L(1) = Sum_{k=1..oo} Kronecker(D,k)/k.at n=10A003420
- Squarefree integers m such that the fundamental unit of Q(sqrt(m)) has norm -1. Also, squarefree integers m such that the Pell equation x^2 - m*y^2 = -1 is soluble.at n=51A003654
- Numbers k such that the continued fraction for sqrt(k) has odd period length.at n=54A003814