14089
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 14356
- Proper Divisor Sum (Aliquot Sum)
- 267
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13824
- Möbius Function
- 1
- Radical
- 14089
- 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
- 63
- 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
- Pseudoprimes to base 7.at n=23A005938
- Pseudoprimes to base 63.at n=31A020191
- Strong pseudoprimes to base 7.at n=7A020233
- Strong pseudoprimes to base 43.at n=14A020269
- Strong pseudoprimes to base 49.at n=9A020275
- Scale factor by which primitive Pythagorean triangle {x=A088509(n), y=A088510(n), z=A088511(n)} needs be enlarged in order to circumscribe the smallest integral square having a side on the hypotenuse.at n=18A088544
- Number of different ways angles from Pi/n to (n-1)Pi/n can tile around a vertex, where rotations of an angle sequence are not counted, but reflections that are different are counted.at n=7A098913
- a(n) is the minimum positive integer j such that [j, j+n-1] does not contain any values of sigma(k) (i.e., sum of all positive divisors of k).at n=17A109322
- a(n) is the minimum positive integer j such that [j, j+n-1] does not contain any values of sigma(k) (i.e., sum of all positive divisors of k).at n=18A109322
- A109322 with duplicates removed.at n=7A109323
- Minimum positive integer such that length of the gap described at A109322 is exactly n (in contrast to A109322 where the gap length is >= n).at n=18A110875
- a(n) = Sum_{k=0..n} 2^k*C([(n+k)/2],k)*C([(n+k+1)/2],k) where [x]=floor(x).at n=8A124431
- Number of (w,x,y) with all terms in {0,...,n} and 2*max(w,x,y) >= 3*min(w,x,y).at n=24A213392
- Hilltop maps: number of n X 1 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or vertical neighbor in a random 0..3 n X 1 array.at n=13A218189
- Hilltop maps: number of n X 2 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..3 n X 2 array.at n=6A218804
- T(n,k)=Hilltop maps: number of nXk binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..3 nXk array.at n=34A218810
- Hilltop maps: number of 7Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal or antidiagonal neighbor in a random 0..3 7Xn array.at n=1A218816
- Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to SmallGroup(729,95).at n=4A250239
- Euler pseudoprimes to base 7: composite integers such that abs(7^((n - 1)/2)) == 1 mod n.at n=17A262054
- Numbers n such that the decimal number concat(5,n) is a square.at n=29A273360