14452
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
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 25298
- Proper Divisor Sum (Aliquot Sum)
- 10846
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7224
- Möbius Function
- 0
- Radical
- 7226
- 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
- 120
- 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 the period of the continued fraction for sqrt(k) contains exactly 78 ones.at n=9A031846
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 97 ).at n=37A063370
- a(n) = 8*n^2 + 8*n + 4.at n=42A108099
- Numbers n such that there is no square n-gonal number greater than 1.at n=21A188896
- The least number s having exactly n fours in the continued fraction of sqrt(s).at n=20A206584
- Number of length n+2 0..7 arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=3A250319
- T(n,k)=Number of length n+2 0..k arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=48A250320
- Number of length 4+2 0..n arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero.at n=6A250323
- Total number of parts in all partitions of n into powers of 2: p1 <= p2 <= ... <= p_k such that p_i <= 1 + Sum_{j=1..i-1} p_j.at n=49A343944