8199
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
- 4
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 11856
- Proper Divisor Sum (Aliquot Sum)
- 3657
- 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
- 5460
- Möbius Function
- 0
- Radical
- 2733
- 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
- 114
- 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 that are the sum of 11 positive 11th powers.at n=4A004822
- a(n+1) = [ A*a(n)+B ]/p^r, where p^r is the highest power of p diving [ A*a(n)+B ] and p=2, A=2.00013, B=3.0.at n=16A029580
- McKay-Thompson series of class 12C for the Monster group.at n=11A058206
- Numbers k such that sigma(k-3) + sigma(k+3) = sigma(2*k).at n=13A067129
- a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.at n=40A085688
- Triangle T(n,k) = 10^(n-1) -1 + k*floor(9*10^(n-1)/(n+1)), with 1 <= r <= n, read by rows.at n=9A093850
- a(n) = 10^(n-1) - 1 + n*floor(9*10^(n-1)/(n+1)).at n=3A093852
- Numbers n such that the partition function A000041(k) is even and odd the same number of times for 0 <= k <= n.at n=23A098936
- Large-number statistic from the enumeration of domino tilings of a 3-pillow of order n.at n=10A112834
- Number of ways to build a contiguous building with n LEGO blocks of size 2 X 2 on top of a fixed block of the same size so that the building is symmetric after a rotation by 180 degrees.at n=7A123822
- a(n) = 2^n + ceiling(n/2).at n=13A134522
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[(3^(m-1) + 2*m-1 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=29A146957
- A functionally symmetric Polynomial as a triangle of coefficients: p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[(3^(m-1) + 2*m-1 )*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=34A146957
- a(n) = 200*n - 1.at n=40A157955
- a(n) = smallest number that leads to a new fixed point under the base-2 Kaprekar map of A164884.at n=33A164887
- Number of disconnected 6-regular (sextic) graphs on n vertices.at n=19A165656
- a(n) = 2^n + 7.at n=13A168415
- Number of disconnected 6-regular simple graphs on n vertices with girth exactly 3.at n=19A185063
- Numbers 1 through 10000 sorted lexicographically in binary representation.at n=24A190126
- a(n) = 2*4^n + 7.at n=6A193579