10783
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 11088
- Proper Divisor Sum (Aliquot Sum)
- 305
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10480
- Möbius Function
- 1
- Radical
- 10783
- 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
- 148
- 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 such that sigma(k) = sigma(k+10).at n=20A015880
- Partial sums of A048693.at n=9A048755
- Numbers n such that the Reverse and Add! trajectory of n (presumably) does not reach a palindrome and does not join the trajectory of any term m < n.at n=18A063048
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.at n=19A088753
- Number of partitions of n into at least two parts such that the product of largest and smallest part exceeds n.at n=55A116902
- a(n) = A192525(n)/2.at n=20A192526
- Number of n X n symmetric 0..2 arrays with each element equal to at least two horizontal or vertical neighbors and with new values 0..2 introduced in lower triangular row major order.at n=6A192996
- Number of partitions p of n such that median(p) <= mean(p).at n=33A240218
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=15A245208
- Number of unlabeled rooted trees with n nodes where the outdegrees (branching factors) of adjacent nodes differ by at least one.at n=15A260353
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 541", based on the 5-celled von Neumann neighborhood.at n=21A272807
- Number of minimal total dominating sets in the n-dipyramidal graph.at n=32A298823
- Coordination sequence for "tea" 3D uniform tiling.at n=37A299285
- Number of n X n 0..1 arrays with every element equal to 0, 1 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=5A301535
- Number of nX6 0..1 arrays with every element equal to 0, 1 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=5A301539
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1 or 3 horizontally or vertically adjacent elements, with upper left element zero.at n=60A301541
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome and does not join the trajectory or one of the reverse numbers of the trajectory of any term m < k.at n=18A306232
- Number of nX3 0..1 arrays with every element unequal to 1, 2, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=9A316643