3130
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5652
- Proper Divisor Sum (Aliquot Sum)
- 2522
- 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
- 1248
- Möbius Function
- -1
- Radical
- 3130
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 123
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Coefficients of ménage hit polynomials.at n=4A000450
- Convolved Fibonacci numbers.at n=7A001873
- Coordination sequence T2 for Zeolite Code AFS.at n=43A008024
- Coordination sequence T1 for Zeolite Code STI.at n=38A008234
- Coordination sequence T2 for Zeolite Code -ROG.at n=42A009860
- a(n) = floor( n*(n-1)*(n-2)/22 ).at n=42A011904
- Expansion of -(2*x^3-x^2+x-1)/(x^4-3*x^3+3*x^2-3*x+1).at n=11A013326
- Numbers k such that the continued fraction for sqrt(k) has period 23.at n=11A020362
- a(n) = T(n,n), T given by A026584. Also a(n) is the number of integer strings s(0), ..., s(n) counted by T, such that s(n)=0.at n=11A026585
- a(n) = n-th largest even number in array T given by A027170.at n=44A027183
- Least k such that 1+2+...+k >= E{1,2,...,n}, where E is the 4th elementary symmetric function.at n=11A027918
- Number of symmetric types of (4,2n)-hypergraphs under action of complementing group C(4,2).at n=6A029941
- Sums of distinct powers of 5.at n=34A033042
- Sum of squares of unitary divisors of n.at n=49A034676
- a(n) is the smallest number such that the product a(1)a(2)...a(n) falls between a twin prime pair, starting with a(1)=2.at n=45A036014
- G.f. satisfies A(x) = 1 + x*cycle_index(Klein_4_group, A(x)).at n=9A036720
- Positive numbers having the same set of digits in base 2 and base 5.at n=30A037410
- a(n) = max T(n,k), with T as in A037027.at n=11A038149
- Sums of two distinct powers of 5.at n=11A038474
- Numbers having four 0's in base 5.at n=8A043352