9300
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 27776
- Proper Divisor Sum (Aliquot Sum)
- 18476
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2400
- Möbius Function
- 0
- Radical
- 930
- Omega Function (Ω)
- 6
- 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
- no
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 122
- 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
- Number of Twopins positions.at n=22A005689
- Perimeters of more than one primitive Pythagorean triangle.at n=12A024408
- Number of partitions of n that do not contain 7 as a part.at n=34A027341
- Number of periodic palindromes using exactly five different symbols.at n=11A056491
- Number of primitive (period n) periodic palindromes using exactly five different symbols.at n=11A056501
- a(n) = 3*(n - 2)*(5*n -11).at n=25A060785
- a(n) = Chowla's function of n * sigma(n).at n=47A062785
- Sum of three solutions of the Diophantine equation x^2 - y^2 = z^3.at n=10A085409
- Row sums of triangle A089940.at n=12A089941
- Number of configurations of a variant of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space at one of the enclosing cube corners.at n=9A090577
- Numbers n such that r3(k) * 2^n + 1 is prime, where r3() = A002277 and k is the number of decimal digits of 2^n.at n=24A095967
- Take pairs (a, b), sorted on a, such that T(a)+T(b)=concatenation of a and b, where T(k) is the k-th triangular number A000217(k). Sequence gives values of b.at n=15A096032
- Take pairs (a, b), sorted on a, such that T(a)+T(b)=concatenation of a and b, where T(k) is the k-th triangular number A000217(k). Sequence gives values of b.at n=23A096032
- Slowest increasing sequence where the absolute difference between the last digit of a(n) and the first digit of a(n+1) equals 9.at n=42A101243
- Numbers n such that 4*10^n + 5*R_n - 2 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=16A102991
- a(n) = 10*n*(n+1).at n=30A163761
- The triangle T_2(n, m), where T_2(n, m) is the number of surjective multi-valued functions from {1, 1, 2, 3, ..., n-1} to {1, 2, 3, ..., m} by rows (n >= 1, 1 <= m <= n).at n=25A172106
- a(1)=4. a(n+1) = a(n)+d-1, where d is the smallest prime divisor of (a(n)-1)*(a(n)+1).at n=37A177929
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k blocks of odd length (0<=k<=n).at n=48A180193
- Triangle read by rows: T(n,k) is the number of permutations of [n] having k cycles with at most 2 alternating runs (it is assumed that the smallest element of the cycle is in the first position), 0<=k<=n.at n=38A187247