10575
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 19344
- Proper Divisor Sum (Aliquot Sum)
- 8769
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5520
- Möbius Function
- 0
- Radical
- 705
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 78
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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) = Sum_{k=0..n} f(k)*f(n-k) where f(k) = A002124(k).at n=34A002125
- Vampire numbers: (definition 1): n has a nontrivial factorization using n's digits.at n=20A020342
- a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n+1-k), where k = [ (n+1)/2 ], p = A000040 = the primes.at n=23A024697
- a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n-k+1), where k = [ n/2 ], p = A000040, the primes.at n=23A025129
- Numbers in which 0,1,2,3,4,5 all occur in base 6.at n=29A031947
- Digitally balanced numbers in base 6: equal numbers of 0's, 1's, ..., 5's.at n=29A049357
- Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n).at n=17A058876
- Number of labeled acyclic digraphs with n nodes containing exactly n-2 points of in-degree zero.at n=3A060337
- Number of unimodal partitions/compositions of n into distinct terms.at n=36A072706
- Row sums in A082259.at n=14A082261
- n is divisible by the sum of all divisors of n which are less than the square root of n (values of n where 1 is the only divisor less than sqrt(n) are excluded as trivial cases.).at n=40A088345
- Number of partitions p of n such that min(p) and max(p) have a common factor.at n=47A114326
- Triangle read by rows: first row is 1, and n-th row (n > 0) gives the coefficients in the expansion of the characteristic polynomial of the (n - 1)-th Bernstein basis matrix, horizontal flipped.at n=23A123948
- Q(n,6), where Q(m,k) is defined in A127080 and A127137.at n=31A127148
- Numbers n such that n^3 - 4 and n^3 + 4 are prime.at n=40A161589
- Numbers k which can be split into two numbers x and y such that x^3 + y^2 is a multiple of k.at n=31A162451
- a(n) = n-th odd nonprime * n-th odd number.at n=37A163506
- Numbers k such that 3k-4, 3k-2, 3k+2, and 3k+4 are primes.at n=22A173092
- Triangle T(n, k, q) = Sum_{j=0..10} q^j * floor( binomial(n+1,k)*binomial(n-1,k-1)/(2^j*(n+1)) ) for q = 1, read by rows.at n=49A174043
- Triangle T(n, k, q) = Sum_{j=0..10} q^j * floor( binomial(n+1,k)*binomial(n-1,k-1)/(2^j*(n+1)) ) for q = 1, read by rows.at n=50A174043