10683
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15444
- Proper Divisor Sum (Aliquot Sum)
- 4761
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7116
- Möbius Function
- 0
- Radical
- 3561
- Omega Function (Ω)
- 3
- 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
- 99
- 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
- no
- Odd
- yes
Appears in sequences
- Crystal ball sequence for hexagonal close-packing.at n=14A007202
- Smaller of a pair of consecutive lucky numbers with a gap of 2n.at n=19A031884
- Number of partitions of n into parts not of the form 15k, 15k+2 or 15k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 6 are greater than 1.at n=40A035956
- Number of rooted trees where each node has at most 4 children.at n=13A036718
- Numbers k such that k + the reversal of k is a square.at n=35A061230
- Numbers k such that 3*R_k + 4 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=15A099411
- Counts 3-wild partitions. In general p-wild partitions of n are defined so that they are in bijection with geometric equivalence classes of degree n algebra extensions of the p-adic field Q_p. Here two algebra extensions are equivalent if they become isomorphic after tensoring with the maximal unramified extension of Q_p.at n=13A131140
- a(n) = (9*n^2 - 5*n + 2)/2.at n=49A140064
- 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, -1), (-1, -1, 0), (0, 1, -1), (1, 0, 1), (1, 1, -1)}.at n=9A148724
- Numbers k such that there are 9 digits in k^2 and for each factor f of 9 (1,3) the sum of digit groupings of size f is a square.at n=29A153747
- a(n) = (4*n^3 - 12*n^2 + 14*n + 3)/3.at n=21A161703
- Number of distinct values taken by 4th derivative of x^x^...^x (with n x's and parentheses inserted in all possible ways) at x=1.at n=39A199205
- Number of (w,x,y) with all terms in {0,...,n} and |w-x|+|x-y|+|y-w| > w+x+y.at n=33A213486
- Number of 3 X 3 0..n symmetric arrays with all rows summing to floor(n*3/2).at n=27A213801
- Number of idempotent 3X3 -n..n matrices of rank 2.at n=8A223452
- a(n) = prime(n)^3 mod (n^2 + prime(n)^2).at n=38A243769
- Number of abelian subgroups of the group GL(2, Z(n)), counting conjugates as distinct.at n=7A316559
- Numbers that are both binary Niven numbers and binary Smith numbers.at n=35A334531
- a(n) is the total number of down steps between the 3rd and 4th up steps in all 2-Dyck paths of length 3*n.at n=7A334641
- Expansion of e.g.f. 1/(2 - exp(x) - x^3).at n=6A352299