4268
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
- 5
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 8232
- Proper Divisor Sum (Aliquot Sum)
- 3964
- 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
- 1920
- Möbius Function
- 0
- Radical
- 2134
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 64
- 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
- The convergent sequence A_n for the ternary continued fraction (3,1;2,2) of period 2.at n=12A000962
- Mixed partitions of n.at n=28A002096
- a(n) = prime(n)*(prime(n-1)-1)/2.at n=22A014302
- Coordination sequence T3 for Zeolite Code TER.at n=44A016435
- 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 32.at n=39A031530
- Numbers with exactly five distinct base-8 digits.at n=9A031985
- Trajectory of 3 under map n->17n+1 if n odd, n->n/2 if n even.at n=15A037106
- a(n) = Sum_{i=0..floor((n+1)/2)} T(2i+1,n-2i-1) where T is A049615.at n=48A049619
- Multiples of 11 having only even digits.at n=39A061832
- Smallest multiple of n-th prime with all even digits.at n=24A062281
- In base 4, smallest number that requires n Reverse and Add! steps to reach a palindrome.at n=18A077441
- Ratio A095110(n)/A000079(n-2) rounded down.at n=12A095361
- Ratio A095110(n)/A000079(n-2) rounded to nearest integer.at n=12A095362
- Start with 1 and repeatedly reverse the digits and add 67 to get the next term.at n=16A118214
- Numbers of the form 9*m^2 + 4*m, m an integer.at n=43A185039
- The numbers n in s=n^2 + (n+1)^2 that satisfy the requirement for two consecutive squares c,d with c<d with d-c being the sum of two consecutive squares that c<s<d will give s-c and d-s both being squares.at n=12A192743
- Triangle read by rows, T(n,k) for 0<=k<=n, generalizing A098742.at n=31A216916
- a(n) = Sum_{i=1..n} (A077068(i) - A077065(i)).at n=27A232221
- Number of (n+1) X (1+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=7A234875
- T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=28A234882