5141
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5292
- Proper Divisor Sum (Aliquot Sum)
- 151
- 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
- 4992
- Möbius Function
- 1
- Radical
- 5141
- Omega Function (Ω)
- 2
- 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
- 28
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence T1 for Zeolite Code VNI.at n=44A009907
- In base 11, a(n) = sum of digits of Lucas(a(n)).at n=43A025491
- Number of proper factorizations of p1^n*p2^2, where p1 and p2 are distinct primes.at n=18A031125
- Numbers k not ending in 0 such that for some base b, k_b is the reverse of k_10 (where k_b denotes k written in base b).at n=42A034294
- Sums of 5 distinct powers of 4.at n=11A038473
- Discriminants of real quadratic fields with class number 2 and related continued fraction period length of 8.at n=28A051973
- Number of unlabeled semi-strong digraphs on n nodes with an even number of pairwise different components.at n=5A054954
- Smallest semiprime p*q such that q >= p and q mod p = n.at n=44A064910
- a(0) = 1; for n>0, a(n) = 1 + coefficient of x^n in expansion of 1/Product_{ n >= 2, n not of the form 2^k-1 } (1-x^n).at n=48A078658
- XOR difference triangle, read by rows, of A099898 (in leftmost column) such that the main diagonal equals A099898 shift left and divided by 4.at n=27A099897
- Multiplies by 4 and shifts right under the XOR BINOMIAL transform (A099898).at n=6A099899
- Stern-Jacobsthal numbers.at n=25A101624
- A bisection of the Stern-Jacobsthal numbers.at n=13A101625
- Integers i such that 15*i = A048720bi(23,i).at n=43A115774
- Start with 1 and repeatedly reverse the digits and add 52 to get the next term.at n=22A118149
- a(n) = smallest squarefree number not less than a(n-1)+a(n-2), a(1)=1, a(0)=0.at n=18A118728
- Start with 1027 and repeatedly reverse the digits and add 16 to get the next term.at n=58A119455
- Largest number that is not a sum of n distinct primes, or -1 if such a number does not exist.at n=48A124884
- a(n) = 15*n*(n+1) + 11.at n=18A132208
- Decimal numbers that when converted to hexadecimal produce a number that uses the same digits as the original number.at n=14A133287