14787
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 22464
- Proper Divisor Sum (Aliquot Sum)
- 7677
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9360
- Möbius Function
- 0
- Radical
- 4929
- Omega Function (Ω)
- 4
- 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
- 58
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers whose base-11 representation has exactly 5 runs.at n=12A043648
- Engel expansion of the twin primes constant ~ .660161815846869573927812110014555778432623360284733413319448.at n=8A096189
- Number of distinct products i*j*k*l for 1 <= i <= j <= k <= l <= n.at n=35A100437
- Numbers n such that p(6n) is prime, where p(n) is the number of partitions of n.at n=33A111036
- 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, 0, 0), (-1, 0, 1), (0, 1, -1), (0, 1, 0), (1, -1, 1)}.at n=9A148479
- G.f.: Product_{j>=1} (1+x^j)^(3^j).at n=7A256142
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 65", based on the 5-celled von Neumann neighborhood.at n=28A270085
- Positions of 3's in A264977; positions of 6's in A277330.at n=33A277713
- Strings of 5 digits from 1...9, such that no formula using the single digits in the given order exists that evaluates to 0.at n=20A288355
- One-fifth of the rolling arithmetic mean of the fifth powers of the natural numbers taken five at a time.at n=6A292185
- Number A(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=62A292804
- Numbers k with record value of the least strong pseudoprime to base k (A298756).at n=6A298757
- Partial sums of A299894.at n=31A299895
- Irregular triangle read by rows: Numbers of unbranched k-5-catafusenes.at n=47A323944
- a(n) is the least number k for which A330437(k) = n.at n=33A330704
- a(n) = Sum_{k=1..n} sigma(k)*sigma(2*k), where sigma(n) = A000203(n) is the sum of the divisors of n.at n=17A347108
- Total number of runs of 1's in all length n binary words in which 1's occur in runs of at least 3.at n=18A387573
- Numbers k such that sigma(k) = psi(k) + tau(k)^3.at n=5A390297
- a(n) = Sum_{k=0..n} (k+1) * binomial(2*k+1,2*n-2*k+1).at n=8A391890