10634
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17220
- Proper Divisor Sum (Aliquot Sum)
- 6586
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4896
- Möbius Function
- -1
- Radical
- 10634
- 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
- yes
- Odd
- no
Appears in sequences
- Spiral sieve using Fibonacci numbers.at n=19A005620
- Numbers such that ten iterations of Reverse and Add are needed to reach a palindrome.at n=13A015991
- Positive numbers k such that k and 4*k are anagrams in base 8 (written in base 8).at n=10A023075
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/5 of the elements are <= (n-3)/3.at n=16A048032
- McKay-Thompson series of class 30E for Monster.at n=33A058616
- Numbers which need ten 'Reverse and Add' steps to reach a palindrome.at n=12A065215
- Sum of n-th antidiagonal of A082191.at n=25A082195
- Numbers k such that k + sum_of_digits(k) is a cube.at n=19A084661
- a(n) is the least k such that (k*prime(n)#)^2 + 1, ((k+1)*prime(n)#)^2 + 1 and ((k+2)*prime(n)#)^2 + 1 are 3 primes, where prime(n)# is the n-th primorial.at n=20A098765
- Sum of the numbers of unitary divisors of the binomial coefficients C(n,k), k=0..n.at n=39A103445
- a(n) = n!*((1 + 3n + n^2)*H(n) - n), where H(n) is the n-th harmonic number.at n=4A129587
- Number of solutions of +-1+-2^3+-3^3..+-n^3=0.at n=30A158118
- Numbers k with the property that their basins (as defined in A204539) are 2.at n=24A185001
- Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 0,3,2,1,4 for x=0,1,2,3,4.at n=24A196072
- Number of (n+1) X 4 0..1 arrays with the number of rightwards and downwards edge increases in each 2 X 2 subblock equal to the number in all its horizontal and vertical neighbors.at n=18A206262
- Number of (n+2) X (4+2) 0..3 arrays with every 3 X 3 subblock row and column sum not 2 3 6 or 7 and every diagonal and antidiagonal sum 2 3 6 or 7.at n=8A251890
- Number of length n arrays of permutations of 0..n-1 with each element moved by -2 to 2 places and equal numbers of elements moved upwards and downwards.at n=12A263738
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 782", based on the 5-celled von Neumann neighborhood.at n=33A273536
- Largest number k such that exactly half the numbers in [1..k] are prime(n)-smooth.at n=43A308904
- Number of integer partitions of n without all distinct multiplicities.at n=34A336866