8912
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 17298
- Proper Divisor Sum (Aliquot Sum)
- 8386
- 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
- 4448
- Möbius Function
- 0
- Radical
- 1114
- 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
- 47
- 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
- a(n) = (25*n^4-120*n^3+209*n^2-108*n)/6.at n=8A006529
- Positive numbers having the same set of digits in base 8 and base 9.at n=37A037441
- Denominators of continued fraction convergents to sqrt(499).at n=6A041953
- a(n) = (9n^2 + 9n + 4)/2.at n=44A062123
- Largest eigenvalue, rounded to the nearest integer, of a rank n matrix of 1..n^2 filled successively along rows.at n=25A072333
- Smallest k such that n+k and n*k have the same prime signature, or 0 if no such number exists.at n=47A085073
- p such that p^4 + q^4 = r^4 + s^4 = a(n).at n=24A088728
- Number of A095746-primes in range ]2^n,2^(n+1)].at n=18A095756
- Numbers n such that 2^(n+1)+2n+1 is prime.at n=30A105330
- Number of partitions of n into parts that are neither all squarefree, nor all not squarefree.at n=33A117395
- Numbers k such that A127483(k) = A127483(k+1) - 1 = A127483(k+2) - 2.at n=29A127485
- Number of binary strings of length n with equal numbers of 00010 and 11100 substrings.at n=14A164227
- Minimum number n, not already present, that permits the cyclic repetition of the decimal digits 1,2,3,4,5,6,7,8,9 in the sequence.at n=31A165307
- Number of (n+1) X 3 binary arrays with every 2 X 2 subblock nonsingular.at n=7A183682
- Number of (n+1)X9 binary arrays with every 2X2 subblock nonsingular.at n=1A183687
- T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock nonsingular.at n=37A183688
- T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock nonsingular.at n=43A183688
- Size of optimal DNA code of length n and minimal distance 1 over alphabet of size 4.at n=7A188632
- E.g.f. tan(x)/(1-tan(x)-tan(x)^2).at n=6A189392
- T(n,k)=Two-loop graph coloring a rectangular array: number of nXk 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=36A223255