10868
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 23520
- Proper Divisor Sum (Aliquot Sum)
- 12652
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4320
- Möbius Function
- 0
- Radical
- 5434
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 68
- 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) = floor( n*(n-1)*(n-2)/23 ).at n=64A011905
- a(n) = greatest residue of S(n,m) mod C(n-1,m-1), for m = 1,2,...,n; S(n,m) are Stirling numbers of second kind.at n=16A024424
- Number of partitions of n into parts not of the form 25k, 25k+7 or 25k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=34A036006
- Number of ways to place two nonattacking queens on an n X n board.at n=12A036464
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=38A050036
- a(n) = 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) = 4.at n=38A050052
- a(n) = a(n-1) + a(m) for n >= 3, 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 and a(2) = 3.at n=38A050068
- Number of symmetric nonnegative integer 8 X 8 matrices with sum of elements equal to 4*n, under action of dihedral group D_4.at n=11A054498
- Non-palindromic number and its reversal are both multiples of 13.at n=40A062912
- Expansion of (1-3x)/(1-x^2+x^3).at n=32A117374
- Expansion of q * (chi(-q) / chi(-q^4))^8 in powers of q where chi() is a Ramanujan theta function.at n=10A134747
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, 0), (1, -1, 0), (1, 0, -1)}.at n=9A148688
- a(n) = 16*n^2 + 2*n.at n=25A158056
- Number of binary strings of length n with no substrings equal to 0000 0001 or 0100.at n=12A164409
- Potential magic constants of 8 X 8 magic squares composed of consecutive primes.at n=27A189188
- a(n,k) equals the number of semistandard Young tableaux with shape of a partition of n and maximal element <= k.at n=58A191714
- Super anti-abundant numbers.at n=23A192269
- Numbers divisible by prime(d) for each digit d in their base-9 representation, none of which may be zero.at n=40A256879
- Number of n X n X n triangular 0..1 arrays with horizontal row sums nondecreasing from top to bottom.at n=5A278295
- k-digit composite numbers Sum_{j=0..k-1} d_(j)*10^j with exactly k prime factors, p_(0), p_(1), ..., p_(k-2), p_(k-1), written in ascending order, such that Sum_{j=0..k-1} d_(j)^p_(j) is a prime number.at n=41A283805