10447
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
- 4
- Divisor Sum
- 10816
- Proper Divisor Sum (Aliquot Sum)
- 369
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10080
- Möbius Function
- 1
- Radical
- 10447
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 60
- 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
- Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k.at n=17A036260
- Number of partitions satisfying (cn(0,5) = cn(1,5) = cn(4,5) and cn(0,5) <= cn(2,5) and cn(0,5) <= cn(3,5)).at n=61A036824
- Denominators of continued fraction convergents to sqrt(137).at n=11A041251
- Denominators of continued fraction convergents to sqrt(548).at n=9A042049
- Numerator of (1/n)*Sum_{k=0..n-1} 1/binomial(n-1,k) for n>0 else 0.at n=15A046878
- Sum of 1-bits between the most and least significant bits summed for all primes in range ]2^n,2^(n+1)].at n=13A095298
- Number of partitions of n such that the set of parts and the set of multiplicities of parts are disjoint.at n=50A114639
- Partial sums of skinny numbers (A061909).at n=41A130596
- Partial sums of A002522, starting at n=1.at n=30A145066
- Numbers n with property that n^2 is a concatenation of three 3-digit primes.at n=2A153139
- a(n) = A168174(n)-10^12.at n=12A168248
- Define two triangular arrays by: B(0,0)=C(0,0)=1, B(0,r)=C(0,r)=0 for r>0, C(t,-1)=C(t,0); and for t,r >= 0, B(t+1,r)=C(t,r-1)+2C(t,r)-B(t,r), C(t+1,r)=B(t+1,r)+2B(t+1,r+1)-C(t,r). Sequence gives array B(t,r) read by rows.at n=29A177011
- Even-index Fibonacci partition triangle read by rows.at n=62A197956
- Number of (n+2)X3 0..3 arrays with every 3X3 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order.at n=1A204049
- Number of (n+2)X4 0..3 arrays with every 3X3 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order.at n=0A204050
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order.at n=1A204056
- T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order.at n=2A204056
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209759; see the Formula section.at n=53A209760
- Numbers n such that in Collatz (3x+1) trajectory of n, the number of terms < n equals number of terms > n.at n=23A217731
- Number of partitions p of n such that max(p) - 2*min(p) is a part of p.at n=40A238626