14932
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
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 26138
- Proper Divisor Sum (Aliquot Sum)
- 11206
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7464
- Möbius Function
- 0
- Radical
- 7466
- Omega Function (Ω)
- 3
- 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
- 89
- 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
- Numbers k such that 10*3^k + 1 is prime.at n=22A005539
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 72 ones.at n=20A031840
- Triangle of column sequences with a certain o.g.f. pattern.at n=38A112500
- Third column of triangle A112500.at n=6A112502
- Number of 7-step self-avoiding walks on an n X n square summed over all starting positions.at n=6A188152
- Number of 0..7 arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors.at n=3A200870
- T(n,k)=Number of 0..k arrays x(0..n+1) of n+2 elements without any interior element greater than both neighbors or less than both neighbors.at n=48A200871
- Number of 0..n arrays x(0..5) of 6 elements without any interior element greater than both neighbors or less than both neighbors.at n=6A200874
- Number of Gram blocks [g(j), g(j+1)) up to 10^n, 0 <= j < 10^n, which contain exactly three zeros of Z(t), where Z(t) is the Riemann-Siegel Z-function.at n=4A231165
- Number of length n+3 0..4 arrays with no four elements in a row with pattern abab (with a!=b) and new values 0..4 introduced in 0..4 order.at n=5A243040
- T(n,k)=Number of length n+3 0..k arrays with no four elements in a row with pattern abab (with a!=b) and new values 0..k introduced in 0..k order.at n=41A243044
- Number of (n+2)X(7+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=30A254906
- Number of (n+1) X (2+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically.at n=8A258548
- G.f. satisfies: A(x)^2 = A( x^2/(1 - 2*x - 4*x^2) ).at n=9A274479
- p-INVERT of (1,1,1,1,1,...), where p(S) = 1 - S^3 - S^6.at n=14A290997
- Numbers that are the sum of seven fourth powers in five or more ways.at n=35A345571
- Numbers that are the sum of seven fourth powers in exactly five ways.at n=34A345827