10554
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
- 21120
- Proper Divisor Sum (Aliquot Sum)
- 10566
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 3516
- Möbius Function
- -1
- Radical
- 10554
- 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
- 148
- 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
- a(n) = floor(exp(17/23) * n!).at n=6A030812
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(0,5) + cn(2,5) + cn(3,5).at n=36A039866
- McKay-Thompson series of class 36C for Monster.at n=41A058646
- Numbers which are the sum of their proper divisors containing the digit 5.at n=14A059464
- a(n)=2*3^n - 18*4^n + 24*5^n.at n=4A091433
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 1), (0, -1), (0, 1), (1, 0), (1, 1)}.at n=8A151460
- Number of n X n arrays of squares of integers, symmetric about main diagonal, with all rows summing to 52.at n=3A156515
- Number of permutations of 1..n with i-5<=p(i)<=i+4.at n=7A179340
- Total area of the largest inscribed rectangles of all integer partitions of n.at n=21A182099
- T(n,k)=Number of nondecreasing -k..k vectors of length n whose dot product with some nonincreasing -k..k vector equals n.at n=59A226398
- Number of nondecreasing -n..n vectors of length 5 whose dot product with some nonincreasing -n..n vector equals 5.at n=6A226402
- Number of length n 1..(5+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.at n=8A254215
- Expansion of Product_{k>=1} 1/(1-x^(3*k-1))^k.at n=48A262876
- Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change -1,1 -1,2 1,0 or 0,-1.at n=8A264545
- Numbers k such that the sums (with multiplicity) of prime factors of k and k+1 are both squares.at n=16A359445
- Triangle T(n,k) in which row n lists in increasing order the number of acyclic orientations of complete multipartite graphs K_lambda, where lambda is a partition of n into distinct parts; triangle T(n,k), n>=0, k = 1..A000009(n), read by rows.at n=24A370614
- Number T(n,k,j) of acyclic orientations of the complete tripartite graph K_{n,k,j}; triangle of triangles T(n,k,j), n>=0, k=0..n, j=0..k, read by rows.at n=27A372261
- Triangle T(n,k) in which row n lists in increasing order the number of acyclic orientations of complete multipartite graphs K_lambda, where lambda is a partition of n; triangle T(n,k), n>=0, k = 1..A000041(n), read by rows.at n=53A372396
- Numbers that can be written in exactly two different ways as s_1^x_1 + ... + s_t^x_t, with 1 < s_1 < ... < s_t and {s_1,..., s_t} = {x_1,..., x_t} for some t > 0.at n=23A386966