14372
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 25158
- Proper Divisor Sum (Aliquot Sum)
- 10786
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7184
- Möbius Function
- 0
- Radical
- 7186
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 32
- 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
- Shapes of height-balanced AVL trees of height at most 5 with n nodes.at n=22A036662
- Bessel function J_0(n) is a monotonically decreasing positive sequence.at n=29A046960
- a(n) is the least positive integer k such that g(k) = n*g(k-1), where g(k) = prime(k+1) - prime(k).at n=9A078563
- Permanent of the symmetric n X n matrix M defined by M(i,j) = gcd(i,j) for 1 <= i,j <= n.at n=5A085244
- Triangle read by rows: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, n>=0, fibonacci(n+2)<=k<=2^n.at n=26A143897
- a(n) = 9*Fibonacci(2n+1) - 1.at n=8A153873
- Irregular triangle read by rows: T(n,k) is the number of permutations in S_n having k stretching pairs.at n=35A216120
- Triangle read by columns: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, k>=1, A029837(k)<=n<A072649(k).at n=27A217298
- Number of height minimal AVL trees with n (leaf-) nodes.at n=21A217299
- Number of n X 3 0..1 arrays with rows, diagonals and antidiagonals unimodal and columns nondecreasing.at n=26A223833
- Expansion of F(x^2, x) where F(x,y) is the g.f. of A239927.at n=72A239928
- Numbers n such that n^2 is a sum of 2 and also of 4 consecutive primes.at n=17A252066
- Integers m of the form m = 3*p + 5*q = 5*r + 7*s where {p,q} and {r,s} are pairs of consecutive primes.at n=6A283392
- Number of n X 4 0..1 arrays with every element unequal to 0, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=12A304006
- a(n) = floor(x(n)) where x(n) = (frac(x(n-1))+1)*floor(x(n-1)) and x(1) = Pi.at n=23A339412
- a(n) is the number of partitions of n in which no part is divisible by 3 minus the number of basis partitions of n.at n=51A350636
- Numbers k such that the decimal expansion of k and 14^k both begin with 14.at n=14A352239