14642
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 21966
- Proper Divisor Sum (Aliquot Sum)
- 7324
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7320
- Möbius Function
- 1
- Radical
- 14642
- 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
- 45
- 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
- sigma_4(n): sum of 4th powers of divisors of n.at n=10A001159
- a(n) = n^4 + 1.at n=11A002523
- Numerator of sum of -4th powers of divisors of n.at n=10A017671
- Cyclotomic polynomials at x=11.at n=8A019329
- Cyclotomic polynomials at x=-11.at n=8A020510
- Numbers k such that k^2 is palindromic in base 11.at n=27A029996
- Sums of distinct powers of 11.at n=17A033047
- a(n) = 11^n + 1.at n=4A034524
- Sum of fourth powers of unitary divisors.at n=10A034678
- Sums of 2 distinct powers of 11.at n=6A038490
- Numbers whose cube is palindromic in base 11.at n=8A046243
- Becomes prime after exactly 7 iterations of f(x) = sum of prime factors of x.at n=34A047826
- Sum of 4th powers of odd divisors of n.at n=21A051001
- Sum of 4th powers of odd divisors of n.at n=10A051001
- Numbers k such that k^10 == 1 (mod 11^4).at n=10A056094
- a(n) = n^4*Product_{distinct primes p dividing n} (1+1/p^4).at n=10A065960
- Sum of two powers of 11.at n=10A073211
- A014486-encoding of the branch-reduced binomial-mod-2 binary trees.at n=2A080293
- A014486-encoding of plane binary trees (Stanley's d) whose interior zigzag-tree (Stanley's c, i.e., tree obtained by discarding the outermost edges of the binary tree) is isomorphic to a valid plane binary tree (Stanley's d).at n=6A080299
- A014486-encoding of binary trees whose left and right subtree are identical.at n=7A083939