13200
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 60
- Divisor Sum
- 46128
- Proper Divisor Sum (Aliquot Sum)
- 32928
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3200
- Möbius Function
- 0
- Radical
- 330
- 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
- 138
- 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
- Number of invertible 2 X 2 matrices mod n.at n=10A000252
- Number of 2 X 2 matrices with entries mod n and nonzero determinant.at n=10A005353
- a(n) = n*(n+4)*(n+5)/6.at n=40A005586
- Denominator of B_{2n}/(-4n), where B_m are the Bernoulli numbers.at n=10A006863
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/23 ).at n=25A011933
- a(n) = (2*n - 7)*n^2.at n=20A015242
- a(n) = (prime(n+2)^2 - 1)/3.at n=43A024700
- Eisenstein series E_20(q) (alternate convention E_10(q)), multiplied by 174611.at n=1A029830
- Number of ways to partition n elements into pie slices each with an odd number of elements allowing the pie to be turned over.at n=27A032277
- Number of ways to partition n elements into pie slices each with at least 2 elements allowing the pie to be turned over.at n=27A032278
- Numbers k whose decimal representation, read as a base-20 value and divided by k, yields an integer.at n=46A032571
- 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=13A036458
- a(n) = n*(n-1)*(n-2)^2.at n=10A047927
- Number of nonsingular n X n matrices over GF(11).at n=2A052498
- n written efficiently in natural numbers base, i.e., in form ...wxyz where n =1*z + 2*y + 3*x + 4*w + ... with z < 1, y < 2, x < 3, w < 4, ...at n=21A055992
- Orders of the finite groups GL_2(K) when K is a finite field with q = A246655(n) elements.at n=7A059238
- Numbers k such that sigma(x) = k has exactly 8 solutions.at n=31A060664
- Numbers k such that cototient(k) is a square and sets a new record for squares.at n=27A063753
- Numbers n such that phi(n) is a proper substring of n.at n=6A066663
- Sum of the first n Sophie Germain primes.at n=36A066819