14254
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
- 4
- Divisor Sum
- 21384
- Proper Divisor Sum (Aliquot Sum)
- 7130
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7126
- Möbius Function
- 1
- Radical
- 14254
- 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
- 164
- 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
- yes
- Odd
- no
Appears in sequences
- Coordination sequence for MgCu2, Mg position.at n=30A009931
- Expansion of 1/((1-5x)(1-7x)(1-11x)(1-12x)).at n=3A028189
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 94 ones.at n=3A031862
- Numbers m such that pi(m) = 1^d_1 + 2^d_2 + ... + k^d_k where d_1 d_2 ... d_k is the decimal expansion of m.at n=6A112718
- Numbers k such that A057775(k) is the factor of a Fermat number 2^(2^m) + 1 for some m.at n=45A201364
- Number of distinct sums <= 1 of reciprocals of positive integers <= n.at n=14A212606
- Number of n X 7 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=12A301789
- G.f. A(x) satisfies: A(x) = 1 + x * ((1 - x) * A(x))^2.at n=16A336165
- Numbers m > 3 such that m-1, m, m+1 belong to A307002.at n=44A340748
- Composite numbers k such that k-A238525(k) and k+A238525(k) are prime.at n=33A342648
- Number of integer partitions of n of whose permutations do not all have distinct runs.at n=35A351203