14420
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 34944
- Proper Divisor Sum (Aliquot Sum)
- 20524
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- 0
- Radical
- 7210
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 58
- Smith Number
- no
- Vampire 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
Appears in sequences
- Repeatedly convert from decimal to octal.at n=21A008557
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=33A024686
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A000201 (lower Wythoff sequence), t = A001950 (upper Wythoff sequence).at n=32A025119
- Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 12.at n=20A031690
- Row sums of triangle A115237.at n=27A115238
- Largest integer terms forming a self-convolution square-root of a sequence A132831 such that: A132831(n) <= 2*A132831(n-1) for n>0 with A132831(0)=1.at n=17A132832
- Numbers k such that k and k+1 have 4 distinct prime factors.at n=11A140078
- Binomial transform of [1, 3, 3, 1, 1, -1, 1, -1, 1, ...].at n=35A140226
- 4 times octagonal numbers: a(n) = 4*n*(3*n-2).at n=35A153794
- Primes in a millennium reach a record minimum: numbers n such that A038823(n) is lower than all A038823(k) with k<n.at n=32A157082
- a(n) = 36*n^2 + n.at n=19A157324
- a(n) = 686*n + 14.at n=20A157366
- 144n^2 + 2n.at n=9A158132
- a(n) = 400*n^2 + 20.at n=6A158601
- Principal diagonal of the convolution array A213847.at n=13A213848
- Equals two maps: number of nX2 binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and vertical neighbors in a random 0..1 nX2 array.at n=7A220238
- T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and vertical neighbors in a random 0..1 nXk array.at n=37A220242
- T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and vertical neighbors in a random 0..1 nXk array.at n=43A220242
- T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..1 nXk array.at n=43A220406
- Nonnegative integers m such that 18*m*(m+1)+1 is a square.at n=6A222393