9848
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18480
- Proper Divisor Sum (Aliquot Sum)
- 8632
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4920
- Möbius Function
- 0
- Radical
- 2462
- Omega Function (Ω)
- 4
- 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
- 73
- 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
- Convolution of Fibonacci numbers 1,2,3,5,... with themselves.at n=13A004798
- Number of protruded partitions of n with largest part at most 6.at n=14A005407
- a(0) = 16, a(n+1) = 3a(n) - (6-n)^2.at n=9A028493
- Numbers k that divide the (right) concatenation of all numbers <= k written in base 19 (most significant digit on left).at n=45A029464
- Number of partitions of n such that cn(0,5) = cn(2,5) <= cn(1,5) <= cn(3,5) = cn(4,5).at n=69A036848
- Expansion of phi(-q^5) / phi(-q) in powers of q where phi() is a Ramanujan theta function.at n=23A138526
- Smallest m such that the n-th odd prime is the smallest prime for all decompositions of 2*m into two primes.at n=28A208662
- Number of partitions of n such that the multiplicity of the least part is a part.at n=37A240493
- Number of partitions p of n such that m(p) = m(c(p)), where m = maximal multiplicity of parts, and c = conjugate.at n=46A240728
- Numbers n for which each of the digits 0-9 appears exactly once as first digit in the orbit of n under iterations of n -> (first digit of n)*(n with first digit removed) until a single digit is reached; no leading zeros allowed.at n=0A257299
- Numbers n such that n!3 - 3^7 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=26A267382
- Array read by antidiagonals: column k lists the 2-Stöhr sequence composed of terms rejected from column k-1.at n=56A271589
- Expansion of Product_{k>=1} (1 + x^(k^2))^2/(1 - x^(k^2))^2.at n=27A279227
- Lapidary numbers.at n=30A332755
- G.f. satisfies A(x) = -(A(x^3) + A(x^4)) / A(-x^2).at n=43A385915