8169
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12480
- Proper Divisor Sum (Aliquot Sum)
- 4311
- 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
- 4656
- Möbius Function
- -1
- Radical
- 8169
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 65
- 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
- Number of partitions of n-set into odd blocks.at n=10A003724
- Number of twin prime pairs below 10^n.at n=5A007508
- Expansion of e.g.f. sinh(sinh(x))*exp(x).at n=9A009598
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (Lucas numbers).at n=14A024459
- Interprimes (A024675) which are of the form s*prime, s=21.at n=21A075296
- a(n) is the least positive integer such that nextprime(a(n)^n) - prevprime(a(n)^n) = 4.at n=36A090125
- Triangle, read by rows, of coefficients in powers of e.g.f. for A100076 such that, for each row n>=0, Sum_{k=0..n} T(n,k)/k! = [sqrt(5)^n].at n=33A100075
- Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} (or of any n-set) having k blocks of even size (0<=k<=floor(n/2)).at n=30A124322
- a(n) = 2*n^3 - 2*n + 9.at n=15A127989
- 9^n mod 2^n.at n=13A138998
- 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, 0), (0, 1, 0), (0, 1, 1), (1, -1, -1)}.at n=8A149901
- Inverse binomial transform of A048775 (assuming offset zero in both sequences).at n=8A163765
- The ED3 array read by antidiagonals.at n=16A167572
- The fifth row of the ED3 array A167572.at n=1A167575
- The second column of the ED3 array A167572.at n=4A167577
- Parameters n for which the Tate-Shafarevich group Ш of the elliptic curve y^2=x^3-n has order 16.at n=41A179140
- Number of 0..n arrays x(0..5) of 6 elements with zero 3rd differences.at n=49A200273
- a(n) is the number of binary words containing n 1's and at most n 0's that do not contain the substring 101.at n=9A225034
- Number of length n words on alphabet {0,1} such that the length of every maximal block of 0's (runs) is the same.at n=18A243815
- Number of partitions of n such that least and largest parts are distinct and occur the same number of times.at n=41A265259