5092
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9520
- Proper Divisor Sum (Aliquot Sum)
- 4428
- 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
- 2376
- Möbius Function
- 0
- Radical
- 2546
- 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
- 33
- 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
- a(n) = (11*n+1)*(11*n+10).at n=6A001536
- Expansion of x*(1+x-x^2)/((1-x)^4*(1+x)).at n=37A005744
- Numbers k not congruent to 0 (mod 3) such that phi(k) + 4 | sigma(k).at n=6A015806
- Fibonacci sequence beginning 3, 20.at n=13A022129
- Expansion of Product_{m >= 1} (1 + q^m)^(-2).at n=50A022597
- Number of irreducible representations of symmetric group S_n for which every matrix has determinant 1.at n=29A045923
- Number of leaves on the rooted tree of height n constructed by the following rule. Assign weight 1 to the single node at height 1. At each node of weight w at height k>0, branch to nodes at height k+1 as follows: one node of weight 1 and a node of weight d+1 if d divides w.at n=9A054657
- First (leftmost) digit - second digit + third digit - fourth digit .... = 12.at n=34A061881
- Nonsquares which are the product of two numbers with the same digits (leading zeros are forbidden).at n=29A072443
- Coefficients of replicable function number "48g".at n=50A073252
- If k is a number with exactly two distinct decimal digits, say a and b, neither of which is 0 (i.e., a member of A101594), define the self-complement of k, SC(k), to be the number obtained by replacing a with b and vice versa. Then a(n) = lcm(A101594(n), SC(A101594(n))).at n=45A083986
- Number of triangular partitions of n of order 3.at n=24A084439
- Numbers n such that n and n+1 both are members of A074997; i.e., on the one hand n-1 and n+1 have the same prime signature, on the other hand n and n+2 have the same prime signature.at n=30A086540
- Spt function: total number of smallest parts (counted with multiplicity) in all partitions of n.at n=22A092269
- Number of 8k+1 primes (A007519) in range ]2^n,2^(n+1)].at n=17A095009
- Numbers k such that the digits of sigma(k) are a permutation of those of k, in base 10.at n=14A115920
- Numbers which are the product of a non-palindrome and its reversal, where leading zeros are not allowed.at n=29A129623
- Product of n-th prime and n-th prime written backwards.at n=18A133019
- a(n) = n*(3*n + 20).at n=38A140689
- a(0) = 0, a(1) = 1, a(n+1) = (2*n^2+2*n+7)*a(n) - n^4*a(n-1), n >= 1.at n=4A142996