8163
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11804
- Proper Divisor Sum (Aliquot Sum)
- 3641
- 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
- 5436
- Möbius Function
- 0
- Radical
- 2721
- 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
- 52
- 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
- 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 89.at n=23A031587
- "Sloping binary representation" of powers of 3 (A000244), slope = -1.at n=20A037095
- Base 5 digits are, in order, the first n terms of the periodic sequence with initial period 2,3,0,1.at n=5A037745
- a(1) = 9; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime.at n=45A046259
- Triangle T(n,k) of numbers of minimal 4-covers of an unlabeled n+4-set that cover k points of that set uniquely (k=4,..,n+4).at n=46A057967
- pi(n) is a power of 2, where pi(n) = A000720(n) is the number of primes <= n.at n=39A073798
- a(n) is the least triprime T for which the Mertens function M(T) = n.at n=26A123174
- 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, 0, 0), (-1, 1, 1), (0, 1, -1), (1, 0, 1)}.at n=8A149330
- Number of binary strings of length n with no substrings equal to 0001 or 1010.at n=12A164399
- The cost of all leaves in the Fibonacci tree of order n.at n=14A178521
- Wiener index of the n-web graph.at n=17A180576
- a(n) = n^2 + 731*n + 1.at n=11A180919
- Fibonacci sequence beginning 14, 13.at n=14A206564
- Numbers which do not reach zero under either of the iterations: x -> floor(sqrt(x)) * (x - floor(sqrt(x))^2) or y -> ceiling(sqrt(y)) * (ceiling(sqrt(y))^2 - y).at n=6A219963
- a(n+1) is equal to a(n) plus the number of primes between a(n) and 2*a(n) exclusively.at n=50A220851
- Table read by antidiagonals of numbers of form (2^n -1)*2^(m+2) + 3 where n>=1, m>=1.at n=52A224380
- a(n) is the minimum number greater than a(n-1) such that the concatenation a(n) U a(n-1) U ... U a(1) is a Niven number, starting with a(1)=1.at n=39A239543
- Number of partitions p of n such that m(p) < m(c(p)), where m = maximal multiplicity of parts, and c = conjugate.at n=35A240726
- Number of inequivalent (mod D_4) ways to place 2 nonattacking knights on an n X n board.at n=17A243717
- Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 3.at n=13A244704