9495
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 16536
- Proper Divisor Sum (Aliquot Sum)
- 7041
- 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
- 5040
- Möbius Function
- 0
- Radical
- 3165
- Omega Function (Ω)
- 4
- 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
- 153
- 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
- Number of degree-n permutations of order exactly 2.at n=9A001189
- Numbers whose base-5 representation contains exactly three 0's and two 4's.at n=26A045216
- Partial sums of rows of A047884. Young Tableaux by height.at n=53A049400
- a(n) is the smallest number not already used such that Sum_{m = 0 .. n-1} a(m)*a(m+1) is a square.at n=55A065337
- Bisection of A001189.at n=4A066222
- Partition the concatenation 1234567... of natural numbers into successive strings which are multiples of 3 all different and > 3. (0 never taken as the most significant digit.)at n=59A077296
- Triangle read by rows: T(n,k) gives the number of set partitions of {1,...,n} with maximum block length k.at n=46A080510
- Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: (1/2) times number of linearly inducible orderings of n points in k-dimensional Euclidean space.at n=39A087644
- a(n) = Sum_{k=0..floor(n/5)} C(n-4k,k+1).at n=31A099559
- Sum C(n-4k,k-1), k=0..floor(n/5).at n=39A099562
- Number of 2-overlap triangle-free perfect graphs on n nodes.at n=8A123469
- Triangle read by rows: T(n,k) is the number of permutations of n elements that have the longest cycle length k.at n=46A126074
- Numbers of the form 86+p^2 (where p is a prime).at n=24A138692
- Triangle read by rows: T(n,k) = number of forests on n labeled nodes, where k is the maximum of the number of edges per tree (n>=1, 0<=k<=n-1).at n=46A143911
- a(n) = (8*5^n + 5*3^(n+1) - 5*2^n)/3.at n=5A147543
- A partition product of Stirling_1 type [parameter k = 1] with biggest-part statistic (triangle read by rows).at n=46A157391
- Number of binary strings of length n with equal numbers of 00011 and 01101 substrings.at n=14A164232
- Start with 3. If a, b in sequence, so is ab+1.at n=43A180432
- Number T(n,k) of standard Young tableaux of n cells and height >= k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=57A182222
- a(n) = 12*n^3 + 9*n^2 + 2*n.at n=9A191745