14848
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 30690
- Proper Divisor Sum (Aliquot Sum)
- 15842
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7168
- Möbius Function
- 0
- Radical
- 58
- Omega Function (Ω)
- 10
- 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
- 27
- 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
- yes
- Odd
- no
Appears in sequences
- Number of trees of diameter 4.at n=35A000094
- sin(arcsinh(x)*sinh(x))=2/2!*x^2-80/6!*x^6-1344/8!*x^8+14848/10!*x^10...at n=5A012647
- Composite numbers whose prime factors contain no digits other than 2 and 9.at n=38A036313
- Consider the trajectory of n under the iteration of a map which sends x to 3x - sigma(x) if this is >= 0; otherwise the iteration stops. The sequence gives values of n which eventually reach 0.at n=30A037159
- Numbers that are divisible by exactly 10 primes with multiplicity.at n=33A046314
- Number of labeled trimmed trees with n nodes.at n=8A052320
- Coefficient triangle of polynomials (rising powers) related to Pell number convolutions. Companion triangle is A058402.at n=20A058403
- Coefficient triangle of polynomials (falling powers) related to Pell number convolutions. Companion triangle is A058404.at n=15A058405
- Number of open positions in the game Fair Share and Varied Pairs starting with n tokens.at n=35A060463
- Triangle of coefficients of polynomials (rising powers) useful for convolutions of A001333(n+1), n >= 0 (associated Pell numbers).at n=20A062133
- Product of sums of divisors and non-divisors.at n=30A066859
- Smallest number m such that m and the product of digits of m are both divisible by 8n, or 0 if no such number exists.at n=63A073912
- a(n)=Sum((-1)^(i+Floor(n/2))S(2i+e),(i=0,..,Floor(n/2))), where S(n) are generalized Tetranacci numbers (A073817) and e=(1/2)(1-(-1)^n).at n=15A075112
- Number of ways to partition 2n+1 into distinct positive integers.at n=31A078408
- Number of ways to partition 4*n+3 into distinct positive integers.at n=15A078410
- a(n) = 2^(n-1) * prime(n).at n=9A110295
- Even values of the PartitionsQ function A000009.at n=50A118303
- Triangle read by rows in which row n lists n+1 terms, starting with n^4 and ending with n^5, such that the difference between successive terms is equal to n^4 - n^3.at n=39A163284
- Numbers of the form p^9*q where p and q are distinct primes.at n=8A179692
- Numbers k such that (number of prime factors of k counted with multiplicity) less (number of distinct prime factors of k) = 8.at n=19A195092