5624
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 11400
- Proper Divisor Sum (Aliquot Sum)
- 5776
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2592
- Möbius Function
- 0
- Radical
- 1406
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 173
- 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 inequivalent n X n binary matrices, where equivalence means permutations of rows or columns.at n=5A002724
- Expansion of (1+2*x+x^2)/(1-74*x+x^2).at n=2A004299
- Coordination sequence T2 for Zeolite Code VNI.at n=46A009908
- a(n) = floor(n*(n-1)*(n-2)/9).at n=38A011891
- Powers of fourth root of 10 rounded up.at n=15A018074
- a(n) = (d(n)-r(n))/2, where d = A026054 and r is the periodic sequence with fundamental period (1,0,0,0).at n=35A026055
- Triangle read by rows: T(n,k) = number of n-node graphs with k nodes in distinguished bipartite block, k = 0..n.at n=60A028657
- 8 times triangular numbers: a(n) = 4*n*(n+1).at n=37A033996
- Numbers having four 4's in base 5.at n=23A043368
- a(n) = T(3,n), array T given by A048505.at n=7A048508
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), with a(1) = a(2) = 1.at n=15A049884
- a(n) = Sum_{d|n, n/d=1 mod 4} d^3 - Sum_{d|n, n/d=3 mod 4} d^3.at n=17A050471
- a(n) is twice the smallest k such that A051686(k) = prime(n).at n=44A051692
- Twice the positions in A051686 at which new primes appear in that sequence.at n=29A051861
- Number of 5 X n binary matrices up to row and column permutations.at n=5A052264
- Numbers k such that k^4 == 1 (mod 5^4).at n=35A056091
- Number of 5 X 5 matrices with entries mod n, up to row and column permutation.at n=1A058003
- a(0)=1, a(n) = 8*n*(2*n-1).at n=19A067239
- Numbers k such that tau(k) - tau(k+1) = 1.at n=10A068208
- a(n) is the number of essentially different ways in which the integers 1,2,3,...,n can be arranged in a sequence such that (1) adjacent integers sum to a prime number and (2) squares of adjacent numbers sum to a prime number. Rotations and reversals are counted only once.at n=55A074063