9153
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 13794
- Proper Divisor Sum (Aliquot Sum)
- 4641
- 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
- 6048
- Möbius Function
- 0
- Radical
- 339
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 2
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
- 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 colored labeled n-node graphs with 2 interchangeable colors.at n=5A000684
- Number of partitions of n into parts not of the form 21k, 21k+4 or 21k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=35A035982
- Numbers n such that n | 9^n + 8^n + 1.at n=14A057296
- Triangle T(n,k) of numbers of minimal 4-covers of an unlabeled n+4-set that cover k points of that set uniquely (k=4,..,n+4).at n=47A057967
- a(n) is the (n+1)st (n+2)-gonal number.at n=26A064808
- Sums of terms of groups in A075626.at n=26A075629
- Number of ascents of length at least 2 in all skew Dyck paths of semilength n.at n=41A128751
- 28-gonal numbers: a(n) = n*(13*n - 12).at n=27A161935
- Partial sums of A000132.at n=19A175360
- Numbers k for which 6k+1, 24k+5, 432k^2+72k-1, and 432k^2+90k-1 are all prime.at n=19A175513
- Numbers k such that the decimal digits of k*(k+1) are a permutation of those of k*(k-1).at n=9A181775
- Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-2,0,1,2}, n=3*r+p_i, and define a(-2)=1. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,1,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^2-1) with x=2*cos(Pi/9).at n=37A187499
- Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p = {p_1, p_2, p_3, p_4} = {-2,0,1,2}, n=3*r+p_i, and define a(-2)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,3,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(x^2-1) with x=2*cos(Pi/9).at n=34A187501
- Number of arrangements of n+1 numbers x(i) in -2..2 with the sum of x(i)*x(i+1) equal to zero.at n=5A188351
- T(n,k)=Number of arrangements of n+1 numbers x(i) in -k..k with the sum of x(i)*x(i+1) equal to zero.at n=26A188358
- Number of arrangements of 7 numbers x(i) in -n..n with the sum of x(i)*x(i+1) equal to zero.at n=1A188362
- Left edge of the triangle A045975.at n=26A204556
- Numbers n such that sum of squares of digits of n equals the sum of prime divisors of n.at n=21A217390
- The Wiener index of the cyclic phenylene with n hexagons (n>=3).at n=6A224456
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 20", based on the 5-celled von Neumann neighborhood.at n=39A269713