6380
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
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 8740
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2240
- Möbius Function
- 0
- Radical
- 3190
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 75
- 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
- Numbers k such that k! + 1 is prime.at n=18A002981
- One half of 9-factorial numbers.at n=3A035012
- Base-9 palindromes that start with 8.at n=17A043035
- Distinct even numbers in the numerators of the 1/3-Pascal triangle (by row).at n=32A046559
- Distinct even numbers in writing first numerator and then denominator of each element to the right of the central elements of the 1/3-Pascal triangle (by row).at n=29A046562
- Coefficients of the '6th-order' mock theta function 2 mu(q).at n=43A053273
- a(n) = Sum_{k = 1..n, gcd(k,n)=1} k*(n-k).at n=43A057789
- Numbers which have more different digits than their squares.at n=35A061277
- Numbers having exactly three prime gaps in their factorization.at n=36A073495
- Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3 are consecutive primes, where p(i) denotes the i-th prime.at n=5A088066
- A088258 indexed by A000142.at n=36A088412
- Numbers with exactly one arithmetic progression of four successive divisors (not necessarily consecutive).at n=8A094530
- Number of A095322-primes in range ]2^n,2^(n+1)].at n=17A095324
- Number of A095318-primes in range ]2^n,2^(n+1)].at n=17A095328
- a(n) = n^2 + (n concatenated with n).at n=43A105814
- Row sums of triangular array A122930.at n=9A122931
- Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 00100-00100-11111-00100 pattern in any orientation.at n=18A147329
- a(n) = 16*n^2 - n.at n=19A157446
- One-eighth of triangular numbers (integers only).at n=39A157716
- a(n) = 64*n^2 - 2*n.at n=9A158067