14999
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15336
- Proper Divisor Sum (Aliquot Sum)
- 337
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14664
- Möbius Function
- 1
- Radical
- 14999
- 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
- 89
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 21 ones.at n=6A031789
- Offsets for the Atkin Partition Congruence theorem.at n=46A036492
- a(n) = smallest k such that 2k has digit sum = n.at n=36A077491
- Largest integer not expressible as a nonnegative linear combination of n and n^2 + 1.at n=24A087908
- Odd numbers n for which 17 is the smallest i (>= 1) with Jacobi symbol J(i,n) getting either a value 0 or -1.at n=16A112077
- a(n) = 625*n - 1.at n=23A158374
- a(n) = 24*n^2 - 1.at n=24A158544
- The number of n-digit numbers requiring 4 nonzero squares in their representation as sum of squares.at n=4A180347
- Values of b such that (c+9b)*prime(n)#-1 is the least prime such that (c+kb)*prime(n)#-1 are all primes for 0 <= k <= 9, or 0 if there is no solution with c+9b < prime(n)#.at n=12A188367
- Numbers which contain only the digit 4 in their base-5 representation, with at most one exception. If the exception is the most-significant digit, it must be the digit 1, 2, or 3, otherwise the exception must be the digit 3.at n=33A188531
- Lesser of super amicable pair m < n defined by sigma(sigma(m)) = sigma(sigma(n)) = m + n.at n=1A324255
- Expansion of Product_{i>=1, j>=1} (1 + x^(i*(2*j - 1))).at n=37A327731
- a(n) = A070826(n+1) - 2^(n-1).at n=4A330349
- Define the Fibonacci polynomials by F[1] = 1, F[2] = x; for n > 2, F[n] = x*F[n-1] + F[n-2] (cf. A049310, A053119). Swamy's inequality states that F[n]^2 <= G[n] = (x^2 + 1)^2*(x^2 + 2)^(n-3) for all n >= 3 and all real x. The sequence gives a triangle of the coefficients of the even exponents of G[n] - F[n]^2 read by rows.at n=48A335444
- Terms in the Fibostracci sequence A359128 that arise as the sum of the two previous terms.at n=65A357048
- a(n) = Sum_{d|n} (-1)^(n/d-1) * binomial(d+2,3).at n=45A366813
- Number of defective (binary) heaps on 2n elements from the set {0,1} where exactly n ancestor-successor pairs do not have the correct order.at n=9A372642
- a(n) is the minimum number of squares from which an n-fold totally concave polyomino (n-TCP) can be made.at n=48A385602