9254
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15888
- Proper Divisor Sum (Aliquot Sum)
- 6634
- 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
- 3960
- Möbius Function
- -1
- Radical
- 9254
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 109
- 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) = n^3 - floor( n/3 ).at n=21A002901
- Coordination sequence for Ni2In, Position Ni2.at n=29A009942
- Convolution of Lucas numbers and odd numbers.at n=13A023620
- Numbers whose base-5 representation contains exactly two 0's and three 4's.at n=23A045213
- If n mod 2 = 0 then a(n) = n^4/4 - 2*n^2 + 3*n; otherwise, a(n) = n^4/4 - 2*n^2 + 3*n - 5/4.at n=14A064835
- Stirling_2 transform of A002487.at n=7A071016
- Triangle read by rows: CP(n,i) for n>=0 and 3n+1 >= i >= 0, gives the absolute value of the coefficients of the chromatic polynomial of C_3 X P_(n+1) factored in the form x(x-1)^i.at n=33A123531
- Number of binary strings of length n with no substrings equal to 0001 1011 or 1100.at n=16A164489
- Smith numbers of order 2.at n=38A174460
- Number of 3-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=13A187858
- Number of n X 2 0..1 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=38A201347
- Zeroless numbers n whose digit product squared is equal to the digit product of n^2.at n=7A256115
- a(n) = n*(25*n - 39)/2.at n=28A263231
- Integers n such that A002110(n) is divisible by A098999(n).at n=36A264897
- Numbers n such that the decimal digits of n-phi(n) are a permutation of those of n.at n=26A273799
- Expansion of Product_{k>=2} 1/(1 - x^k)^bigomega(k), where bigomega(k) is the number of prime divisors of k counted with multiplicity (A001222).at n=32A293549
- Numbers m such that m and m+1 are consecutive lazy-Fibonacci-Niven numbers (A328212).at n=33A328213
- Numbers that are the sum of nine fourth powers in seven or more ways.at n=37A345591
- Numbers that are the sum of nine fourth powers in exactly seven ways.at n=25A345849
- G.f. A(x) satisfies: A(x) = 1 / ((1 - x) * (1 - x * A(2*x))).at n=5A348857