9195
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14736
- Proper Divisor Sum (Aliquot Sum)
- 5541
- 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
- 4896
- Möbius Function
- -1
- Radical
- 9195
- 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
- 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
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that 59*2^k+1 is prime.at n=7A032379
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=2, r=3, I={1,2}.at n=17A080003
- a(n)=a(n-1)+sum of digits(a(n-1))*sum of digits(a(n-2)).at n=36A108720
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 1), (0, 0, 1), (1, -1, 0), (1, 1, -1)}.at n=9A148407
- a(n) = 242*n - 1.at n=37A157961
- a(n) = 484*n - 1.at n=18A158330
- a(n) = 76*n^2 - 1.at n=10A158765
- Partial sums of Sum_{k=1..n} n/gcd(n,k), or partial sums of Sum_{d|n} d*phi(d) (see A057660).at n=32A174405
- a(n) = n*(21*n-17)/2.at n=30A226491
- Partitions with parts repeated at most twice and repetition only allowed if first part has an odd index (first index = 1).at n=47A227134
- Number of (n+2) X (7+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 3 5 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 3 5 6 or 7.at n=18A252253
- Indices where records occur in A265432.at n=30A272675
- Numbers that appear in both A278909 and A280967 but not in A280971.at n=33A280972
- Numbers k such that 8*10^k - 67 is prime.at n=16A294380
- Solution of the complementary equation a(n) = a(n-1) + a(n-3) + a(n-4) + b(n-3), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4, b(0) = 5, b(1) = 6, b(2) = 7, b(3) = 8, and (a(n)) and (b(n)) are increasing complementary sequences.at n=17A295755
- Number of integer partitions of n with no 1's such that no part is a power of any other (unequal) part.at n=48A323053
- a(n) is the maximal determinant of an n X n Hermitian Toeplitz matrix using all the integers 1, 2, ..., n and with all off-diagonal elements purely imaginary.at n=5A359615
- Expansion of Sum_{k>0} x^(2*k)/(1-x^k)^4.at n=35A363604
- Consecutive states of the linear congruential pseudo-random number generator (430*s + 2531) mod 11979 when started at s=1.at n=31A384431
- Consecutive states of the linear congruential pseudo-random number generator (625*s + 6571) mod 31104 when started at s=1.at n=14A385279