6417
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9984
- Proper Divisor Sum (Aliquot Sum)
- 3567
- 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
- 3960
- Möbius Function
- 0
- Radical
- 2139
- 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
- 62
- 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
- Repeatedly convert from decimal to octal.at n=20A008558
- Number of parts in all partitions of all the numbers in {1,2,...,n} into distinct parts.at n=28A015724
- Numbers with more than one factorization into S-primes. See A054520 and A057948 for definition.at n=39A057949
- Numbers primitive with respect to having more than one factorization into S-primes. See related sequences for definition.at n=32A057950
- Numbers n such that 7*3^n - 2 is prime.at n=28A058605
- Write 1, 2, 3, 4, ... counterclockwise in a hexagonal spiral around 0 starting left down, then a(n) is the sequence found by reading from 0 in the vertical upward direction.at n=23A063436
- Numbers k such that binomial(prime(k), k) is divisible by k^2.at n=17A081384
- a(1)=1, a(n)=2a(n-1)+1 if a(n-1) is prime, a(n)=a(n-1)+1 otherwise.at n=40A083005
- a(n) is the smallest positive integer k such that, if kn is written in base 2, it requires exactly n ones.at n=14A102032
- Sum of the squares of the first n squarefree numbers.at n=20A111715
- Number of partitions of n having exactly one part with multiplicity 3.at n=37A118808
- Connell (5,3)-sum sequence (partial sums of the (5,3)-Connell sequence).at n=53A122795
- Triangle, read by rows, where row n equals the inverse binomial transform of the column n in rectangular table A124550 (starting with row 1).at n=18A124568
- a(n) is the smallest positive integer such that a(n)*n is an anagram of a(n)*2.at n=12A175691
- Number of (n+1) X 3 0..2 arrays with all 2 X 2 subblock sums the same.at n=5A183996
- Number of (n+1) X 7 0..2 arrays with all 2 X 2 subblock sums the same.at n=1A184000
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with all 2X2 subblock sums the same.at n=22A184003
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with all 2X2 subblock sums the same.at n=26A184003
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n having k UDU's, where U = (1,1) and D = (1,-1).at n=68A191316
- Numbers a = b + c where a, b, and c contain the same decimal digits.at n=10A203024