9148
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 16016
- Proper Divisor Sum (Aliquot Sum)
- 6868
- 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
- 4572
- Möbius Function
- 0
- Radical
- 4574
- Omega Function (Ω)
- 3
- 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
- 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
- Eight iterations of Reverse and Add are needed to reach a palindrome.at n=34A015988
- Numbers k such that the continued fraction for sqrt(k) has period 96.at n=17A020435
- Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=47A036808
- Numbers k such that (3^k + 5)/2 is prime.at n=20A058960
- Numbers which need eight 'Reverse and Add' steps to reach a palindrome.at n=29A065213
- sigma(n) plus the n-th prime gives a square.at n=37A114082
- Integer part of Gauss's Arithmetic-Geometric Mean M(2,n^3).at n=40A127764
- Triangle T(n, k) = n!*Sum_{j=k..n} (-1)^(j+k)*binomial(k+j, j)/j!, read by rows.at n=30A156984
- Number of 5-step E, S, NW and NE-moving king's tours on an n X n board summed over all starting positions.at n=8A187588
- Number of (n+1) X 3 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=34A206261
- Number of (n+1)X(2+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically, with no adjacent elements equal.at n=9A232400
- Number of partitions p of n such that (number of even numbers in p) <= 2*(number of odd numbers in p).at n=33A241642
- Number of nX7 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-2) and new values introduced in order 0..2.at n=2A276247
- T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-2) and new values introduced in order 0..2.at n=38A276248
- Number of 3 X n 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-2) and new values introduced in order 0..2.at n=6A276249
- Expansion of Product_{k>=0} 1/(1-x^(5*k+1))^(5*k+1).at n=36A285049
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2) + 3, where a(0) = 1, a(1) = 2, b(0) = 3.at n=15A294535
- Consecutive internal states of the linear congruential pseudo-random number generator (3877*s + 29573) mod 139968 when started at 1.at n=15A385459