6296
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11820
- Proper Divisor Sum (Aliquot Sum)
- 5524
- 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
- 3144
- Möbius Function
- 0
- Radical
- 1574
- Omega Function (Ω)
- 4
- 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
- 62
- 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 stereoisomeric paraffins with n carbon atoms.at n=13A000626
- a(n) = floor( n*(n-1)*(n-2)/25 ).at n=55A011907
- 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 19.at n=37A031517
- Number of partitions of n with equal nonzero number of parts congruent to each of 1, 2 and 3 (mod 5).at n=56A035588
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=13A049948
- a(n) = A048141(3*n+1).at n=55A051059
- Least positive integers, all distinct, that satisfy sum(n>0,1/a(n)^z)=0, where z=(60+I*11)/61.at n=36A084804
- Frequency of the hexadecimal 0 in the first 10^n hexadecimal digits of Pi.at n=4A099333
- Erroneous version of A000626.at n=13A119716
- Number of base 28 n-digit numbers with adjacent digits differing by one or less.at n=6A126382
- Numbers k such that k and k^2 use only the digits 1, 2, 3, 6 and 9.at n=20A136981
- Number of n X 6 binary arrays without the pattern 0 1 diagonally, vertically or antidiagonally.at n=26A188863
- Number of nondecreasing arrangements of n+2 numbers in 0..8 with the last equal to 8 and each after the second equal to the sum of one or two of the preceding four.at n=16A189325
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210287; see the Formula section.at n=50A209999
- G.f. satisfies: A(x) = 1 + x*A(x*A(x)^3)^2.at n=6A212028
- Numbers ((binomial(4*p-1,2*p-1) mod p^5)-3)/p^3, where p = prime(n).at n=29A224952
- Number of length n 1..(2+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.at n=22A254212
- Number of 2Xn 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=11A280400
- Number of partitions in which each summand, s, may be used with frequency f if f divides s.at n=45A296116
- Triangle read by rows: T(n,k) = number of noncrossing path sets on n nodes up to rotation with k paths and isolated vertices allowed.at n=47A303869