14673
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20128
- Proper Divisor Sum (Aliquot Sum)
- 5455
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9504
- Möbius Function
- -1
- Radical
- 14673
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 177
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Numbers k such that k^2 is palindromic in base 8.at n=43A029805
- Composites c whose decimal expansion ends with its largest prime factor.at n=36A050693
- Engel expansion of 1/log(10) = 0.434294....at n=12A059184
- Numbers that contain as proper substrings every maximal prime power dividing them.at n=7A059401
- Numbers with more than one prime factor that do not end in 0 and contain as substrings every maximal prime power dividing them.at n=1A059402
- Numbers that are the products of distinct substrings (>1) of themselves and do not end in 0.at n=19A059470
- Numbers k such that 2*10^k + 6*R_k - 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=20A098959
- Number of reduced words of length n in the Weyl group B_23.at n=4A161930
- Number of reduced words of length n in the Weyl group D_23.at n=4A162365
- Number of partitions of n containing at least one part m-7 if m is the largest part.at n=34A212547
- Number of defective 4-colorings of an n X 3 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..3 order.at n=9A229573
- a(n) = floor(6^n/(2+2*cos(Pi/9))^n).at n=22A240733
- Number of partitions p of n such that the number of parts is not a part and max(p) - min(p) is not a part.at n=37A241385
- a(n) = prime(n)^3 mod (n^2 + prime(n)^2).at n=30A243769
- Partial sums of A301692.at n=93A301693
- Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 4 or 5 king-move adjacent elements, with upper left element zero.at n=8A304342
- Numbers k for which rank of the elliptic curve y^2=x^3+k*x is 4.at n=8A309031
- Numbers k such that k and 4k, taken together, contain all digits 1 though 9 at least once.at n=14A346135
- a(1) = 1; a(n) = a(n-1) + 2 * a(floor(n/2)).at n=36A347027
- Index of first occurrence of n in A349325.at n=23A350278