15600
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 60
- Divisor Sum
- 53816
- Proper Divisor Sum (Aliquot Sum)
- 38216
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3840
- Möbius Function
- 0
- Radical
- 390
- Omega Function (Ω)
- 8
- Little Omega Function (ω)
- 4
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
- 146
- 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
- yes
- Odd
- no
Appears in sequences
- Glaisher's function G(n) (18 squares version).at n=18A002609
- a(n) = n*(n-1)*(n-2) (or n!/(n-3)!).at n=26A007531
- Orders of non-cyclic simple groups (divided by 4).at n=27A008976
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/23 ).at n=26A011933
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/27 ).at n=27A011937
- a(n) = (2*n - 1)*n^2.at n=20A015237
- For all n, if d is recursively applied to a(n) exactly 6 times then the fixed point of d-iteration is just reached.at n=16A036458
- Numbers whose base-4 representation contains exactly three 0's and four 3's.at n=15A045080
- Number of nonnegative solutions of x1^2 + x2^2 + ... + x10^2 = n.at n=19A045852
- Triangle read by rows: T(n,k) = k!*binomial(n-1,k-1)*Stirling2(n,k), 1 <= k <= n.at n=18A048743
- Smallest positive number of "triangular" shuffles of n(n+1)/2 cards needed to restore them to their original order.at n=27A048782
- The number k(GL(n,q)) of conjugacy classes in GL(n,q), q=5.at n=6A049315
- 23-gonal numbers: a(n) = n(21n-19)/2.at n=39A051875
- Triangle read by rows, T(n, k) = Sum_{i=0..n} L'(n, n-i) * binomial(i, k), for k = 0..n-1.at n=18A059374
- Numbers k such that sigma(x) = k has exactly 9 solutions.at n=35A060665
- a(n) = (2*n+2)*(2*n+3)*(2*n+4) = 24*A000330(n+1).at n=11A069074
- Dimension of n-th graded section of a certain Lie algebra.at n=9A072279
- a(n) = floor(average of first n cubes).at n=38A078618
- Triangle of generalized Stirling numbers S_{3,2}(n,k) read by rows (n>=1, 2<=k<=2n).at n=21A078740
- a(n) = p(n)/p(n-1), where p(n) = ( floor(n*log(n)) / Product_{j=2..pi(floor(n*log(n)))} prime(j) )!.at n=9A088301