4941
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 7502
- Proper Divisor Sum (Aliquot Sum)
- 2561
- 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
- 3240
- Möbius Function
- 0
- Radical
- 183
- Omega Function (Ω)
- 5
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = solution to the postage stamp problem with 3 denominations and n stamps.at n=41A001208
- Centered cube numbers: n^3 + (n+1)^3.at n=13A005898
- Coordination sequence T3 for Zeolite Code CAS.at n=43A008065
- Numbers k that divide s(k), where s(1)=1, s(j)=13*s(j-1)+j.at n=21A014861
- Numbers k such that k divides s(k), where s(1)=1, s(j) = s(j-1) + j*13^(j-1).at n=11A014953
- Place where n-th 1 occurs in A023125.at n=36A022787
- Number of distinct products i*j with 0 <= i, j <= n-th prime.at n=31A027419
- Numbers k such that 33*2^k+1 is prime.at n=22A032366
- Decimal concatenation of n-th lucky number and n-th prime number.at n=12A032604
- a(n) = (3*n+1)*(4*n+1).at n=20A033577
- Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 5).at n=53A035573
- Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,3.at n=6A037590
- a(n)=T(n,n+2), array T as in A049735.at n=27A049742
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=13A049898
- 16-gonal (or hexadecagonal) numbers: a(n) = n*(7*n-6).at n=27A051868
- Expansion of (1-3*x)/(1 - 4*x - x^2 + 3*x^3).at n=7A052926
- Expansion of 1/((1+3*x)*(1-9*x)).at n=4A053535
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.at n=21A057260
- a(0) = 1, a(1) = 9; for n >= 2 a(n) is the number of degree-n monic reducible polynomials over GF(9), i.e., a(n) = 9^n - A027381(n).at n=4A058824
- Numbers of the form (10*a + b)^2 + (10*b + a)^2 with a and b less than 10, in numerical order.at n=22A061191