6475
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
- 9424
- Proper Divisor Sum (Aliquot Sum)
- 2949
- 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
- 4320
- Möbius Function
- 0
- Radical
- 1295
- 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
- 49
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence for MgNi2, Position Mg1.at n=20A009936
- Pseudoprimes to base 26.at n=37A020154
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 3 skipped primes.at n=42A050770
- Triangle T(n,k) of asymmetric n X n binary matrices with k=0..n^2 ones under action of dihedral group of the square D_4.at n=32A054645
- Triangle T(n,k) of asymmetric n X n binary matrices with k=0..n^2 ones under action of dihedral group of the square D_4.at n=47A054645
- Smallest composite x such that sigma(x+2^n) = sigma(x) + 2^n.at n=8A054987
- Number of trees with n nodes and 5 leaves.at n=15A055292
- a(n) = 5*n^2 + 10*n.at n=34A067724
- a(n) = 4*n^2 + 10*n + 1.at n=39A082112
- Smallest multiple of the n-th prime such that every partial sum is a square.at n=11A085039
- Position of first occurrence of n in A090544.at n=53A090546
- Least k such that decimal representation of k*n contains only digits 0 and 7.at n=11A096686
- Triangle read by rows in which row n gives coefficients of polynomial R_n(y) that satisfies R_n(1/2) = 8^n, where R_n(y) forms the initial (n+1) terms of g.f. A097182(y)^(n+1).at n=13A097181
- Numbers n such that pi(n) = product of digits of n.at n=9A097220
- Numbers n such that for some k and a_1,a_2,...,a_k the concatenation of the a_i is equal to n and their product is equal to pi(n).at n=32A097221
- Inverse modulo 2 binomial transform of 6^n.at n=5A100739
- Largest member z of a triple 0<x<y<z such that z^2-y^2, z^2-x^2 and y^2-x^2 are perfect squares.at n=36A111105
- a(n) = C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1).at n=14A115567
- Numbers m such that the product of the digits of m is equal to the number of primes less than m.at n=10A117273
- Triangle T(n,k) read by rows = number of partitions of n-set into k blocks with distinct sizes, k = 1..A003056(n).at n=37A131632