14682
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 29376
- Proper Divisor Sum (Aliquot Sum)
- 14694
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4892
- Möbius Function
- -1
- Radical
- 14682
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 133
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.at n=33A047881
- Numbers which are the sum of their proper divisors containing the digit 4.at n=23A059463
- Erroneous version of A007717.at n=7A068593
- a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n*a(n-1).at n=39A095234
- Shadow of Euler's constant exp(1).at n=37A108912
- a(n) = a(n-1) + a(n-3) + a(n-5).at n=20A122115
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (0, 1, 0), (1, 1, -1), (1, 1, 1)}.at n=8A150131
- Largest number which requires n iterations of the unitary totient function (A047994) to reach 1.at n=12A225172
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 694", based on the 5-celled von Neumann neighborhood.at n=29A273411
- Start with 443; if even, divide by 2; if odd, add next three primes: Orbit of 443 under iterations of A174221, the "PrimeLatz" map.at n=7A293978
- Number of integer partitions of n with at least one pair of consecutive divisible parts.at n=35A328221
- Rounded value of z(n)*prime(n), where z(n) = imaginary part of n-th nontrivial zero of the Zeta function and prime(n) = n-th prime.at n=32A342756
- a(0) = 0; for n >= 1, a(n) = -(3/2)*(a(n-1)+A355905(n-1)).at n=23A355906