8818
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13230
- Proper Divisor Sum (Aliquot Sum)
- 4412
- 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
- 4408
- Möbius Function
- 1
- Radical
- 8818
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=28A024972
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 92.at n=24A031590
- Denominators of continued fraction convergents to sqrt(925).at n=7A042789
- Numbers having three 8's in base 10.at n=17A043523
- Numbers k such that prime(k) + prime(k+1)*2 is a square.at n=19A064504
- Smallest semiprime containing exactly n 8's.at n=2A104761
- Near-repdigit semiprimes with 8 as repeated digit.at n=6A105989
- 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, 0, 1), (0, 1, -1), (1, -1, 0), (1, 1, 1)}.at n=8A149435
- 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, 0), (-1, 1, -1), (0, 1, 1), (1, -1, -1), (1, 1, 1)}.at n=7A150687
- G.f.: A(x) = G(G(x)) where G(x) = x*exp( Sum_{n>=1} A(x^n)/n ).at n=6A179323
- Number of subsets of {1, 2, ..., n} containing n and having <=8 pairwise coprime elements.at n=34A186992
- Numbers consisting of ones and eights.at n=27A213084
- Number of n X 2 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 diagonally or antidiagonally.at n=5A229374
- Number of nX6 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 diagonally or antidiagonally.at n=1A229378
- T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 diagonally or antidiagonally.at n=22A229380
- T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 diagonally or antidiagonally.at n=26A229380
- Number of (n+3)X(3+3) 0..1 arrays with each row divisible by 13 and column not divisible by 13, read as a binary number with top and left being the most significant bits.at n=2A263301
- T(n,k)=Number of (n+3)X(k+3) 0..1 arrays with each row divisible by 13 and column not divisible by 13, read as a binary number with top and left being the most significant bits.at n=12A263303
- Number of (3+3)X(n+3) 0..1 arrays with each row divisible by 13 and column not divisible by 13, read as a binary number with top and left being the most significant bits.at n=2A263306
- Numbers n for which |n/zeta(2) - Q(n)| sets a new record, where Q(x) is the number of squarefree numbers up to x.at n=29A275390