10630
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
- 8
- Divisor Sum
- 19152
- Proper Divisor Sum (Aliquot Sum)
- 8522
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4248
- Möbius Function
- -1
- Radical
- 10630
- 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
- yes
- 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
- Expansion of 1 / Product_{n>=0} (1-q^(5n+1))(1-q^(5n+2))(1-q^(5n+3)).at n=45A107234
- Total number of restricted right truncatable primes in base n.at n=31A133757
- Number of binary words of length n containing at least one subword 10^{7}1 and no subwords 10^{i}1 with i<7.at n=45A143287
- Number of (n+1) X 3 binary arrays with rows and columns in nondecreasing order and with no 2 X 2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one.at n=20A184064
- Total sum of parts of multiplicity 3 in all partitions of n.at n=30A222731
- Smallest number k such that sopf(k)/digsum(k) = prime(n) where sopf(k) is the sum of the distinct primes dividing k and digsum(k) the sum of digits of k.at n=27A241049
- Number of length n+6 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=30A255997
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 657", based on the 5-celled von Neumann neighborhood.at n=19A273336
- Number of compositions of n if only the order of the even numbers matter.at n=25A275592
- a(n) = Sum_{d|n} d^2 * (d+1)/2.at n=26A278403
- Number of rooted twice-partitions of n.at n=16A301480
- Number A(n,k) of n-element subsets of [k*n] whose elements sum to a multiple of n. Square array A(n,k) with n, k >= 0 read by antidiagonals.at n=60A304482
- Numbers k such that k^2 reversed is a prime and k^2+(k^2 reversed) is a prime.at n=20A306301
- Number of n-element subsets of [5n] whose elements sum to a multiple of n.at n=5A318433
- Number of n-member subsets of [n^2] whose elements sum to a multiple of n.at n=5A318477
- Number A(n,k) of n-member subsets of [k*n] whose elements sum to a multiple of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=60A318557
- Number of n-member subsets of [5*n] whose elements sum to a multiple of five.at n=5A318593
- Number of 5-member subsets of [5*n] whose elements sum to a multiple of n.at n=5A318626