8930
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 8350
- 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
- 3312
- Möbius Function
- 1
- Radical
- 8930
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 47
- 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
- a(n) = (3*n+1)*(3*n+2).at n=31A001504
- a(n) = 2*n*(2*n+1).at n=47A002943
- Product of the lengths of the cycle types of the permutation created by length sorting on the partitions of n.at n=12A036052
- Product of order of cycles of the permutation created by length sorting on the partitions of n.at n=11A036053
- a(n)^2 is a square whose digits occur with an equal minimum frequency of 2.at n=38A052049
- Numbers k such that 265*2^k + 1 is prime.at n=17A053349
- T(n,n-3), array T as in A054110.at n=27A054112
- Square spiral sequence: numbers are placed in a square spiral, a(1)=1, a(n) is found as the sum of the row (in the previous direction) a(n-1) is in.at n=24A062410
- Add column entries of the table with rows (1,2,0,0...), (0,3,4,5,0,0...), (0,0,6,7,8,9,0,0...), (0,0,0,10,11,12,13,14,0,0...), ...at n=37A064694
- Numbers k such that phi(k) divides (sigma(k+2) + sigma(k-2)).at n=44A067245
- Numbers n such that the area of the parallelogram formed by the vectors (n, prime(n)) and (n+1, prime(n+1)) is an integer square, i.e., Det[{{n, prime(n)},{n+1, prime(n+1)}}] is an integer square.at n=35A067805
- Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) =(b(n)*x + a(n))/(c(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.at n=9A075828
- Deficient oblong numbers.at n=14A077804
- a(n) = A051201(n^2).at n=42A078163
- Average of row n of A082259.at n=19A082262
- Numbers n such that 6*10^n + 7*R_n - 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=5A103042
- 4-almost primes equal to the product of two successive semiprimes.at n=32A108215
- Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the last block is the singleton {k}, 1<=k<=n; the blocks are ordered with increasing least elements.at n=51A108458
- Matrix inverse of triangle A117334.at n=29A117335
- Column 1 of triangle A117335.at n=7A117336