8955
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
- 15600
- Proper Divisor Sum (Aliquot Sum)
- 6645
- 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
- 4752
- Möbius Function
- 0
- Radical
- 2985
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 96
- 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
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=45A004946
- a(0) = 1, a(n+1) = 3 * a(n) - F(n)*(F(n) + 1), where F(n) = A000045(n) is n-th Fibonacci number.at n=9A011769
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=19A031947
- "BIK" (reversible, indistinct, unlabeled) transform of 1,2,3,4...at n=10A032126
- a(n) = (2*n+1)*(9*n+1).at n=22A033573
- Fibonacci iteration starting with (1, a(n)) leads to a "nine digits anagram".at n=15A034587
- Lucky numbers N (A000959) such that Fibonacci iterations starting with (1, N) lead to a "nine digits anagram".at n=0A034589
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=19A049357
- Sum of the quadratic residues of prime(n).at n=45A076409
- Numerator of f(n), where for n > 2, f(n) = (n-1)/f(n-1) + (n-2)/f(n-2), with f(1)=1, f(2)=2.at n=6A076658
- Least multiple of n such that every partial concatenation followed by a 9 is prime.at n=44A105185
- Product of a prime number p and the number of primes smaller than p.at n=45A117495
- Sum of all matrix elements of n X n matrix M[i,j] = Lucas[i+j-1], (i,j = 1..n), where Lucas[n] = A000032[n] = Fibonacci[n-1] + Fibonacci[n+1].at n=7A120537
- Expansion of psi(x^2)^8 * (psi(x)^8 + psi(-x)^8) / 2 in powers of x^2 where psi() is a Ramanujan theta function.at n=4A135828
- Smallest number k such that M(n)^2+k*M(n)+1 is prime with M(n)= Mersenne primes =A000668(n).at n=20A139427
- Triangle read by rows, A007318 * (A007476 * 0 ^(n-k)).at n=63A153859
- a(n) = 242*n + 1.at n=36A157958
- a(n) = 74*n^2 + 1.at n=11A158742
- a(n) = floor((3*4^n - 2*3^n)/5).at n=7A178935
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0) steps at positive heights) with k HUs, where U=(1,1) and H=(1,0).at n=58A191320