10351
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11304
- Proper Divisor Sum (Aliquot Sum)
- 953
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9400
- Möbius Function
- 1
- Radical
- 10351
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 117
- 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
- Fibonacci numbers written in base 7.at n=18A004690
- Numbers k such that the continued fraction for sqrt(k) has period 78.at n=31A020417
- a(n) = T(n,[ n/2 ]), where T is the array defined in A025564.at n=13A025575
- Sums of six consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2.at n=39A027865
- a(n) = binomial(n,0) - binomial(n,2) + binomial(n,4).at n=24A058923
- Centered 10-gonal numbers.at n=45A062786
- a(n) = A077739(n)/n.at n=21A077740
- a(n) = A077739(n)/n.at n=25A077740
- a(n) = A078213(n)/n.at n=21A078214
- a(n) = A078213(n)/n.at n=25A078214
- In binary representation: numbers not occurring in their factorial.at n=40A093685
- Write down the numbers from 3 to infinity. Take next number, M say, that has not been crossed off. Counting through the numbers that have not yet been crossed off after that M, cross off every 5th term. Repeat, always crossing off every 5th term of those that remain. The numbers that are left form the sequence.at n=37A100586
- Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDU's starting at level 0.at n=22A135330
- Number of Dyck paths of semilength n with no UUDU's starting at level 0.at n=10A135336
- a(n) = 46*n^2 + 1.at n=15A158632
- Smallest number m such that exactly n odd numbers can be seen as proper subsequences of m in decimal representation.at n=20A164766
- The number of odd numbers that require n Collatz (3x+1) iterations to reach 1.at n=48A176866
- Smallest possible largest number in a 3 by n average array where repetitions are not allowed without diagonals.at n=7A195753
- Partial sums of A008531, or crystal ball sequence for {A_4}* lattice.at n=9A222408
- a(n) = Sum_{i=1..n} ( Product_{k|i} d(k) ), where d(n) = A000005(n).at n=23A237349