14862
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
- 29736
- Proper Divisor Sum (Aliquot Sum)
- 14874
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4952
- Möbius Function
- -1
- Radical
- 14862
- 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
- 71
- 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
- Number of partitions of n into relatively prime parts. Also aperiodic partitions.at n=35A000837
- Coefficients of cluster series for site percolation problem on f.c.c. lattice with 1st and 2nd neighbor bonds.at n=4A036394
- a(n)-th and (a(n)+1)-st primes are the first pair of primes that differ by exactly 2n; a(n) = -1 if no such pair of primes exists.at n=32A038664
- Numbers which are the sum of their proper divisors containing the digit 4.at n=26A059463
- Increasing peaks in the prime gap sequence A038664.at n=6A086979
- First occurrence of just n semiprimes occurs between the a(n)-th prime and the next prime.at n=22A103669
- Sum of Euler totient function between successive powers of two.at n=7A104191
- Numbers k for which 8*k+1, 8*k+5, 8*k+7 and 8*k+11 are primes.at n=25A123983
- The number of multinomial coefficients, based on a set of partitions of n into m positions, divisible by m entirely.at n=34A200144
- Number of nonnegative integer arrays of length n+3 with new values 0 upwards introduced in order, no three adjacent elements equal, and containing the value 3.at n=5A211830
- T(n,k)=Number of nonnegative integer arrays of length n+k+1 with new values 0 upwards introduced in order, no three adjacent elements equal, and containing the value k+1.at n=26A211836
- Number of nonnegative integer arrays of length n+7 with new values 0 upwards introduced in order, no three adjacent elements equal, and containing the value n+1.at n=1A211840
- Least number x such that there are n numbers of the form 6k-1 or 6k+1 between prime(x) and prime(x+1).at n=21A213903
- G.f.: exp( Sum_{n>=1} A064027(n)*x^n/n ), where A064027(n) = (-1)^n*Sum_{d|n}(-1)^d*d^2.at n=18A224364
- Smallest number that can be written in exactly n ways as sum of two quarter-squares.at n=20A240952
- Expansion of Product_{k>=1} (1 - x^(2*k-1))^(2*k-1)/(1 - x^(2*k))^(2*k).at n=18A281683
- a(n)=position of the first occurrence of a local maximum equal to 2n in A001223, n>1.at n=31A286729
- a(n) is the number of states that can be achieved when starting from n piles each containing one stone, where any number of stones can be transferred between piles that start with the same number of stones.at n=34A292726
- Expansion of Product_{k>=2} (1 + x^Fibonacci(k))/(1 - x^Fibonacci(k)).at n=36A300414
- L.g.f.: log(Product_{k>=1} (1 + k*x^k)) = Sum_{n>=1} a(n)*x^n/n.at n=25A300786