4936
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 9270
- Proper Divisor Sum (Aliquot Sum)
- 4334
- 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
- 2464
- Möbius Function
- 0
- Radical
- 1234
- 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
- 134
- 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
- Let S denote the palindromes in the language {0,1,2,3}*; a(n) = number of words of length n in the language SS.at n=8A007057
- Coordination sequence T4 for Zeolite Code BRE.at n=46A008061
- Coordination sequence T2 for Zeolite Code FER.at n=43A008107
- a(n) = floor(n*(n-1)*(n-2)/15).at n=43A011897
- Number of partitions of n into its divisors with at least one part of size 1.at n=65A014648
- Numbers k such that Fib(k) == -21 (mod k).at n=40A023168
- Number of T-frame polyominoes with n cells.at n=41A028247
- Dirichlet convolution of Fibonacci numbers with Catalan numbers.at n=9A034749
- Numerators of continued fraction convergents to sqrt(13).at n=11A041018
- Number of equilateral triangles formed out of matches that can be found in a hexagonal chunk of side length n in hexagonal array of matchsticks.at n=11A045949
- Number of ordered factorizations with 2 levels of parentheses indexed by prime signatures.at n=19A050357
- a(n) is twice the smallest k such that A051686(k) = prime(n).at n=35A051692
- Twice the positions in A051686 at which new primes appear in that sequence.at n=28A051861
- a(n) = 4*n^2 - 7*n + 4.at n=35A054567
- McKay-Thompson series of class 45A for Monster.at n=47A058684
- Expansion of series related to Liouville's Last Theorem: g.f. Sum_{t>0} (-1)^(t+1) *x^(t*(t+1)/2) / ( (1-x^t)^3 *Product_{i=1..t} (1-x^i) ).at n=34A059820
- Zero-based position of the least significant (rightmost) zero bit in the bit-masks A068222 (A068224).at n=42A068058
- Numbers k such that k+1, k^2+1 and k^4+1 are primes.at n=25A070325
- Smallest number which requires n iterations to reach a prime when iterating x + sum of squares of digits of x.at n=42A094658
- Partial sums of repdigits of A002278.at n=3A099671