10509
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14592
- Proper Divisor Sum (Aliquot Sum)
- 4083
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6720
- Möbius Function
- -1
- Radical
- 10509
- 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
- 29
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = 1*t(n) + 2*t(n-1) + ...+ k*t(n+1-k), where k=floor((n+1)/2) and t is A001950 (upper Wythoff sequence).at n=34A023867
- Lucky numbers with size of gaps equal to 16 (lower terms).at n=31A031898
- Number of rooted trees with a forbidden limb of length 4.at n=12A052327
- a(n) = floor(3^n / n^3).at n=15A062278
- Write the primes in binary; a(n) = total number of 0's in those which have an n-bit expansion.at n=13A086904
- Riordan array (1/(1 + 5*x + x^2), x/(1 + 5*x + x^2))^(-1); inverse of Riordan array A123967.at n=23A125906
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (0, 1, -1), (0, 1, 1), (1, 0, -1)}.at n=9A148694
- Triangle read by rows, T(n, 1) = 1 and T(n,k) = q^k*T(n-1, k) + T(n-1, k-1) for 2 <= k <= n, n >= 1, with q=2.at n=24A176242
- Numbers n such that the difference between the greatest prime divisor of n^2 + 1 and the sum of the other distinct prime divisors is equal to +-1.at n=9A244194
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 611", based on the 5-celled von Neumann neighborhood.at n=20A273214
- a(n) = 8n^2 - 12n + 1.at n=35A273220
- Wiener index for the n-Andrásfai graph.at n=37A292018
- O.g.f. A(x) satisfies: A(x) = 1 + Integral (x/A(x))' / (x/A(x)^4)' dx.at n=6A302701
- Numbers k such that k divides the sum of digits in primorial base of all numbers from 1 to k.at n=25A333703
- Numbers k for which A003973(k) is equal to 2*sigma(k).at n=15A337384
- Number of compositions (ordered partitions) of n into distinct parts >= 5.at n=47A339103
- Main diagonal of A368179: the n-th term in the trajectory of n under the A006368 map.at n=54A368180
- Expansion of g^4/(1 + x*g), where g = 1+x*g^3 is the g.f. of A001764.at n=6A391406