9152
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 28
- Divisor Sum
- 21336
- Proper Divisor Sum (Aliquot Sum)
- 12184
- 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
- 3840
- Möbius Function
- 0
- Radical
- 286
- Omega Function (Ω)
- 8
- 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
- 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 rooted bicubic maps: a(n) = (8*n-4)*a(n-1)/(n+2) for n >= 2, a(0) = a(1) = 1.at n=7A000257
- Powers of rooted tree enumerator.at n=10A000529
- a(n) = floor(n*(n-1)*(n-2)/30).at n=66A011912
- a(n) = n*(9*n-2).at n=32A013656
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = floor( n/2 ), s = natural numbers >= 2, t = natural numbers >= 3.at n=43A024869
- a_n = - sum_{i=1..n-1} C(i+1, n-i) (-1)^(n-i) a_i.at n=5A028380
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 23 (most significant digit on right and removing all least significant zeros before concatenation).at n=9A029540
- Intermediate edge b of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers).at n=18A031174
- Expansion of (3+2*x^2)/(1-x)^4.at n=21A037236
- Triangle: T(n,k), k<=n: commutative groupoids with no symmetry with n elements and k idempotents.at n=12A038022
- (s(n)+1)/10, where s(n)=n-th base 10 palindrome that starts with 9.at n=37A043088
- Numbers whose base-4 representation contains exactly four 0's and two 3's.at n=29A045083
- Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).at n=16A058843
- Number of 2-colored labeled graphs with n nodes.at n=5A058872
- Lesser of two consecutive numbers each divisible by a fourth power.at n=17A068782
- Number of log-concave compositions (ordered partitions) of n.at n=41A069916
- Numbers n such that A076341(n)=0.at n=44A076351
- a(1)=a(2)=1, a(n)=a(n-1)+a(n-2) if n is odd, a(n)=a(n-1)+a(n/2) if n is even.at n=24A078912
- a(n) = 2*a(n-1) + 4*a(n-2) - 4*a(n-3) - 4*a(n-4).at n=10A099176
- Trajectory of 1001 under "3x+1" map.at n=33A100709