14443
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17136
- Proper Divisor Sum (Aliquot Sum)
- 2693
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12000
- Möbius Function
- -1
- Radical
- 14443
- 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
- 102
- 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
- Number of unrooted triangulations with reflection symmetry of a disk with 2 internal nodes and n+3 nodes on the boundary.at n=14A005509
- Positive numbers k such that k and 2*k are anagrams in base 5 (written in base 5).at n=14A023061
- Distinct odd elements in 3-Pascal triangle A028262 (by row).at n=31A028268
- Elements to right of central elements in 3-Pascal triangle A028262 that are not 1.at n=49A028272
- Odd elements (greater than 1) to right of central elements in 3-Pascal triangle A028262.at n=27A028274
- 4-white numbers: partition digits of n^4 into blocks of 4 starting at right; sum of these 4-digit numbers equals n.at n=5A037044
- a(n) = Sum_{k=1..floor(n/2)} T(n, 2k), array T as in A049777.at n=42A049779
- Truncated triangular pyramid numbers: a(n) = (n-5)*(n^2 + 8*n - 66)/6.at n=38A051939
- Triangle of Stirling numbers of order 5.at n=16A059024
- Largest proper divisor of the n-th Carmichael number (A002997).at n=16A081703
- (10^n-1) * (n+9) / 9.at n=4A091692
- Expansion of x*(11+13*x+20*x^2) / ( (x-1)*(1+x)*(10*x^2-1) ).at n=8A094621
- Number of partitions of n in which each odd part has odd multiplicity.at n=40A131942
- Number of lines through at least 2 points of a 9 X n grid of points.at n=28A160849
- Numbers n which are concatenations n=x//y such that x^2+y^3 is a multiple of n.at n=33A162464
- Number of permutations of length n which avoid the patterns 4321 and 2143.at n=9A165525
- Triangle T(n,k) = Sum_{i=1..n} 2^(i-1)*C(n+2*k-i-1, k-1), 1 <= k <= n.at n=19A185139
- Numbers k such that there is 1 prime between 100*k and 100*k + 99.at n=9A186393
- Divisors of the repunit 111111111111 = A002275(12).at n=42A197318
- Number of 0..n arrays x(0..4) of 5 elements with each no smaller than the sum of its three previous neighbors modulo (n+1).at n=9A200669