4844
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9744
- Proper Divisor Sum (Aliquot Sum)
- 4900
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2064
- Möbius Function
- 0
- Radical
- 2422
- 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
- 72
- 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
- Self-convolution of numbers of trees on n nodes.at n=13A006706
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=28A015990
- Every run of digits of n in base 13 has length 2.at n=31A033011
- Records for sum of proper divisors function A001065.at n=46A034091
- Number of partitions of n into parts not of the form 9k, 9k+4 or 9k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 3 are greater than 1.at n=38A035943
- Numbers having three 4's in base 10.at n=29A043507
- Positive integers having more base-13 runs of even length than odd.at n=33A044839
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= sqrt(n).at n=19A048093
- a(n)=T(n,n+2), array T as in A049723.at n=38A049730
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.at n=23A058229
- Intrinsic 8-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=40A060878
- Numbers k such that k*2^m-1 are composites for all exponents m in the range 0<=m<=k.at n=19A061154
- a(n) = binomial(n+5,4) - 1.at n=15A063258
- Numbers which need nine 'Reverse and Add' steps to reach a palindrome.at n=27A065214
- Smallest multiple of (n+1)-st prime which is == 1 mod n-th prime.at n=38A073604
- Partial sums of A000960.at n=25A099074
- a(n) = 5*a(n-1) - a(n-2) for n>1, a(0)=1, a(1)=9.at n=5A099867
- Numbers n whose abundance is 56.at n=40A101260
- a(n) = 100*n + 44.at n=48A102438
- Moebius transform of binomial(n+3, 4).at n=16A117109