10096
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 19592
- Proper Divisor Sum (Aliquot Sum)
- 9496
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 0
- Radical
- 1262
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 42
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 100.at n=18A020439
- Jacobi polynomial P((1, 1), n, (1/2)).at n=7A025175
- Interprimes which are of the form s*prime, s=16.at n=11A075291
- a(n) = p^n + q^n, p = (1 + sqrt(21))/2, q = (1 - sqrt(21))/2.at n=8A085487
- Triangular array read by rows: a(n, k) = number of ordered factorizations of a "hook-type" number with n total prime factors and k distinct prime factors. "Hook-type" means that only one prime can have multiplicity > 1.at n=31A098348
- A tabular sequence of arrays counting ordered factorizations over least prime signatures. The unordered version is described by sequence A129306.at n=47A131420
- A triangular array of numbers related to factorization and number of parts in Murasaki diagrams.at n=50A133611
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 6 and 9.at n=25A136830
- Triangle read by rows, A008277 * A000012.at n=40A137650
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 11000-01111-11000 pattern in any orientation.at n=16A147458
- 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, -1, 0), (-1, 0, 1), (0, 0, -1), (1, -1, -1), (1, 1, 0)}.at n=9A148686
- 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, -1, 0), (-1, 0, 1), (0, -1, 1), (0, 1, -1), (1, 1, 0)}.at n=8A149276
- Variation on Delannoy array/triangle; based on a triangular sum with the base multiplied by 2.at n=45A165251
- Variation on Delannoy array/triangle; based on a triangular sum with the base multiplied by 2.at n=49A165251
- Number of concave kites (darts or arrowheads) on an n X n grid (or geoboard).at n=8A173502
- a(n) = the smallest n-digit number with exactly 10 divisors, a(n) = 0 if no such number exists.at n=4A182679
- a(n) is the smallest 5-digit number with exactly n divisors, or a(n) = 0 if no such number exists.at n=9A182697
- Number of nonnegative integer arrays of length n+4 with new values 0 upwards introduced in order, and containing the value 4.at n=4A211558
- T(n,k) = number of nonnegative integer arrays of length n+k-1 with new values 0 upwards introduced in order, and containing the value k-1.at n=40A211561
- Number of nonnegative integer arrays of length n+4 with new values 0 upwards introduced in order, and containing the value n-1.at n=4A211564