7564
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 13888
- Proper Divisor Sum (Aliquot Sum)
- 6324
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3600
- Möbius Function
- 0
- Radical
- 3782
- Omega Function (Ω)
- 4
- 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
- 39
- 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 n-node trees of height at most 4.at n=14A001384
- Number of partitions of n into at most 8 parts.at n=38A008637
- a(n) = floor(n*(n-1)*(n-2)/30).at n=62A011912
- Numbers k such that the continued fraction for sqrt(k) has period 68.at n=23A020407
- Self-convolution of natural numbers >= 3.at n=30A023551
- Number of partitions of n in which the greatest part is 8.at n=46A026814
- a(n) = T(n,0) + T(n,1) + ... + T(n,[ n/2 ]), T given by A026907.at n=8A026916
- Terminating decimals of length n of form p/5^q using at most one of each nonzero digit.at n=24A027905
- Sums of 6 distinct powers of 3.at n=40A038468
- Numbers k such that k divides the (right) concatenation of all numbers <= k written in base 12 (most significant digit on right).at n=13A061941
- Numbers k such that the number of primes <= k is phi(phi(k)).at n=16A063999
- Numbers having exactly twelve anti-divisors.at n=30A066478
- Numbers k such that k^2 + 1 is composite and phi(k^2 + 1) == 0 (mod k).at n=22A067519
- a(n+1) = 3*a(n-2) + 2*a(n-1), a(n)=x^n+y^n+z^n.at n=14A072329
- Numbers k such that the number of divisors of k equals the number of anti-divisors of k.at n=9A073694
- 4 times hexagonal numbers: a(n) = 4*n*(2*n-1).at n=31A085250
- A card-arranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a fifth power for every i.at n=28A096906
- Expansion of (x^2-2*x)/(x^4-x^2+2*x-1).at n=19A108014
- Numbers whose anti-divisors sum to a prime.at n=38A109350
- Numbers k such that there is a number m < k satisfying A000203(k) = A000203(m) = m + k - gcd(m,k).at n=19A124141