10097
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 10560
- Proper Divisor Sum (Aliquot Sum)
- 463
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9636
- Möbius Function
- 1
- Radical
- 10097
- Omega Function (Ω)
- 2
- 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
- 42
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers).at n=33A024588
- s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = (composite numbers).at n=32A025102
- Number of partitions of n with equal nonzero number of parts congruent to each of 3 and 4 (mod 5).at n=44A035571
- Ramanujan numbers (A000594) read mod 23^3.at n=37A126847
- One-seventh of the difference of squares of legs of primitive Pythagorean triangles, neither of which is a multiple of 7.at n=37A127924
- Number of nonisomorphic orthogonal arrays OA(8*n+4,4,2,2).at n=24A130145
- Numbers k such that k and k^2 use only the digits 0, 1, 4, 7 and 9.at n=28A136865
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (0, 1), (1, -1), (1, 0), (1, 1)}.at n=6A151324
- Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 8, read by rows.at n=37A153653
- Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 8, read by rows.at n=43A153653
- a(n+1) is the smallest integer > a(n) such that the concatenation of [a(n+1)-a(n)] and a(n+1) is a prime number.at n=58A173699
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 3,0,2,1,2,0,0 for x=0,1,2,3,4,5,6.at n=5A197788
- Number of -n..n arrays x(0..5) of 6 elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=38A200184
- Numbers with exactly 12 nonprime substrings (substrings with leading zeros are considered to be nonprime).at n=6A213319
- Generalized Markoff numbers: largest of 7-tuple of positive numbers a, b, c, d, e, f, g satisfying the Markoff(7) equation a^2+b^2+c^2+d^2+e^2+f^2+g^2 = 3abcdefg.at n=27A227211
- Egyptian fraction representation of sqrt(47) (A010501) using a greedy function.at n=4A248273
- a(n) is the smallest composite k such that k divides 2^(k*n-1) - 1.at n=53A317556
- Integers n such that the digit set of n^2 is {0,1,4,9}.at n=22A317579
- Number of integer partitions of n whose parts cannot be arranged into a (not necessarily square) matrix with equal row-sums and equal column-sums.at n=33A323348
- a(0) = 1; a(n) = Sum_{k=0..floor((n-1)/2)} 4^k * a(k) * a(n-2*k-1).at n=10A352008