14743
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15408
- Proper Divisor Sum (Aliquot Sum)
- 665
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14080
- Möbius Function
- 1
- Radical
- 14743
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 45
- Smith Number
- no
- Vampire 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
- no
- Odd
- yes
Appears in sequences
- Expansion of 1/(1-x^3-x^4-x^5-x^6-x^7-x^8-x^9-x^10).at n=30A017823
- First row of spectral array W(sqrt(3)).at n=22A022159
- Numbers k such that k^2 contains exactly 9 different digits.at n=20A054037
- Fifth diagonal of triangle A064094.at n=14A064096
- Numbers m such that the positive values of m - A002110(k) are all primes (k > 0).at n=37A068372
- a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) + a(n-4).at n=11A093406
- a(n) = Sum_{k=0..n} C(n,4k)*2^k.at n=14A097081
- a(n) = (7*n^3 + 6*n^2 + 5*n) / 6.at n=23A101165
- Number of partitions of {1,..,n} into lists with an odd number of lists of size 1, where a list means an ordered subset, cf. A000262.at n=7A111753
- Record values in A180076.at n=40A180080
- Number of (n+2) X 3 binary arrays avoiding patterns 001 and 100 in rows and columns.at n=4A202310
- Number of (n+2)X7 binary arrays avoiding patterns 001 and 100 in rows and columns.at n=0A202314
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 100 in rows and columns.at n=10A202317
- T(n,k)=Number of (n+2)X(k+2) binary arrays avoiding patterns 001 and 100 in rows and columns.at n=14A202317
- Number of n X 3 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=6A207437
- T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=42A207442
- Number of 7Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.at n=2A207447
- a(n) is the position of the last two-tuple within the reverse lexicographic set of partitions of 2n and 2n+1, with a(1)-a(n) representing the positions of every 2-tuple partition of 2n and 2n+1.at n=27A216053
- Main diagonal of Unlucky array: a(n) = A255543(n,n).at n=22A255549
- Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010001 00010101 or 01010101.at n=12A261106