6896
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 13392
- Proper Divisor Sum (Aliquot Sum)
- 6496
- 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
- 3440
- Möbius Function
- 0
- Radical
- 862
- Omega Function (Ω)
- 5
- 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
- 44
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of n with equal number of parts congruent to each of 1 and 4 (mod 5).at n=44A035558
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 4 (mod 5).at n=50A035576
- Composite numbers not ending in zero that yield a prime when turned upside down.at n=43A048889
- a(n) = (1/n!)*A001565(n).at n=18A094792
- a(n) = 16*(8*prime(n) + 7).at n=15A098823
- G.f. satisfies: A(x) = 1/(1 + x*A(x^8)) and also the continued fraction: 1 + x*A(x^9) = [1; 1/x, 1/x^8, 1/x^64, 1/x^512, ..., 1/x^(8^(n-1)), ...].at n=63A101918
- Indices of primes in sequence defined by A(0) = 19, A(n) = 10*A(n-1) - 31 for n > 0.at n=16A102021
- Numbers whose square root in base 10 starts with 10 distinct digits.at n=5A113507
- Let f(n) = minimum of average number of comparisons needed for any sorting method for n elements and let g(n) = n!*f(n). Sequence gives a lower bound on g(n).at n=5A117627
- Number of n-digit "early bird numbers" A116700.at n=3A160234
- G.f.: A(x) = exp( 2*Sum_{n>=1} sigma(n)*A006519(n) * x^n/n ), where A006519(n) = highest power of 2 dividing n.at n=11A162584
- A bisection of A162584.at n=5A163229
- Monotonic ordering of nonnegative differences 2^i-6^j, for 40>=i>=0, j>=0.at n=38A192116
- Number of partitions of n containing at least one part m-7 if m is the largest part.at n=30A212547
- 6^n mod 10000.at n=23A216128
- Numbers equal to the Euler totient function of their arithmetic derivative: k = phi(k').at n=35A217715
- Number of black-square subarrays of (n+2) X (4+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=4A230931
- Number of black-square subarrays of (n+2)X(5+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=3A230932
- T(n,k)=Number of black-square subarrays of (n+2)X(k+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=32A230935
- T(n,k)=Number of black-square subarrays of (n+2)X(k+2) 0..3 arrays x(i,j) with each element diagonally or antidiagonally next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=31A230935