10066
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17280
- Proper Divisor Sum (Aliquot Sum)
- 7214
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4308
- Möbius Function
- -1
- Radical
- 10066
- Omega Function (Ω)
- 3
- 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
- 91
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of n into parts not of the form 9k, 9k+4 or 9k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 3 are greater than 1.at n=43A035943
- Base 5 digits are, in order, the first n terms of the periodic sequence with initial period 3,1,0,2.at n=5A037773
- McKay-Thompson series of class 39C for Monster.at n=45A058661
- Numbers m such that [A070080(m), A070081(m), A070082(m)] is a right integer triangle.at n=18A070136
- Index of first occurrence of n in A091853, or 0 if no such number exists.at n=25A091854
- McKay-Thompson series of class 39C for the Monster group with a(0) = 1.at n=45A094362
- Integers that do not appear in A103502.at n=4A103504
- Number of partitions of n such that if k is the largest part, then k-2 occurs as a part.at n=41A119907
- Expansion of 1/(x^k*(1-x-3*x^(k+1))) for k=5.at n=22A143456
- a(n) = sum of all divisors of all numbers k such that n^2 <= k < (n+1)^2.at n=13A168012
- Number of partitions p of n such that (# 1s in p) = (#1s in conjugate(p)).at n=46A240691
- Numbers n such that the smallest prime divisor of n^2+1 is 97.at n=35A248552
- Magic sums of 3 X 3 semimagic squares composed of positive triangular numbers.at n=39A269060
- Number of tilings of an n X n square using distinct polyominoes.at n=3A291808
- Underline the central digit of all terms: the underlined digits reconstruct the starting sequence. This is also true if one translates the sequence in French and underlines the central letter of each word: the underlined letters spell the (French) sequence again. This is the lexicographically earliest sequence where repeated terms are admitted.at n=51A319718
- Underline the central digit of all terms: the underlined digits reconstruct the starting sequence. This is also true if one translates the sequence in French and underlines the central letter of each word: the underlined letters spell the (French) sequence again. This is the lexicographically earliest sequence of distinct terms.at n=51A319921
- Number of strict odd-length integer partitions of 2n.at n=33A344650
- Number of connected bipartite cubic simple graphs on 2*n unlabeled nodes with a unique 3-edge-coloring up to edge-Kempe equivalence.at n=13A358282
- Number of distinct, irreducible ways that a Pythagorean hyperrectangle of 2 or more dimensions can produce diagonal length n.at n=45A375338