10923
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15936
- Proper Divisor Sum (Aliquot Sum)
- 5013
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6600
- Möbius Function
- -1
- Radical
- 10923
- 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
- 55
- 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
- no
- Odd
- yes
Appears in sequences
- Jacobsthal sequence (or Jacobsthal numbers): a(n) = a(n-1) + 2*a(n-2), with a(0) = 0, a(1) = 1; also a(n) = nearest integer to 2^n/3.at n=15A001045
- Number of transitive permutation groups of degree n.at n=44A002106
- Divisors of 2^30 - 1.at n=39A003538
- a(2*n) = 2*a(2*n-1), a(2*n+1) = 2*a(2*n)-1.at n=15A005578
- a(n) = (2^(2*n + 1) + 1)/3.at n=7A007583
- Number of Barlow packings with group P3(bar)m1(SO) that repeat after 2n-1 layers.at n=15A011950
- a(n) = b(n) - c(n) where b(n) is the n-th Fibonacci number greater than 2 and c(n) is the n-th number not in sequence b( ).at n=17A014251
- Nearest integer to Gamma(n + 7/12)/Gamma(7/12).at n=8A020002
- Ceiling of Gamma(n+7/12)/Gamma(7/12).at n=8A020092
- a(n) = C(n,1) + C(n,4) + ... + C(n, 3*floor(n/3) + 1).at n=14A024494
- a(n) = C(n,2) + C(n,5) + ... + C(n, 3*floor(n/3)+2).at n=15A024495
- a(n) = least m such that if r and s in {1/1, 1/4, 1/7, ..., 1/(3n-2)} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=46A024836
- Numbers k in which the digits of k^2 appear.at n=17A029774
- In A015922, not in A033553.at n=24A033554
- Numbers congruent to 2,3,6,11 mod 12 missing from A042944 (conjectured to be finite).at n=37A042945
- Numbers whose base-2 representation has exactly 13 runs.at n=7A043580
- a(n) = 10*n^2+n.at n=32A055437
- Prime factorization of n encoded with the run lengths of binary expansion + 1.at n=42A075160
- Let u(1)=u(2)=u(3)=2, u(n)=(1+u(n-1)u(n-2))/u(n-3); then a(n) is the numerator of u(n).at n=16A076737
- Expansion of (1-x)^(-1)/(1+2*x^3).at n=42A077886