6486
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 13824
- Proper Divisor Sum (Aliquot Sum)
- 7338
- 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
- 2024
- Möbius Function
- 1
- Radical
- 6486
- Omega Function (Ω)
- 4
- 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
- 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
- yes
- 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 partitions into non-integral powers.at n=18A000158
- Pisot sequence E(5,21), a(n) = floor( a(n-1)^2/a(n-2) + 1/2 ).at n=5A010917
- a(n) = floor(n*(n-1)*(n-2)/15).at n=47A011897
- Numbers whose sum of divisors is a cube.at n=33A020477
- Number of 5-ary rooted trees with n nodes and height at most 6.at n=13A036617
- Numbers k such that the k-th prime is a Fibonacci number reversed.at n=8A036972
- Let Do(n) = A006566(n) = n-th dodecahedral number. Consider all integer triples (i,j,k), j >= k > 0, with Do(i) = Do(j) + Do(k), ordered by increasing i; sequence gives k values.at n=17A053019
- Digits composite, each digit minus 1 is prime, sum of digits minus 1 is prime, difference of digits (in absolute value) minus 1 is prime.at n=28A058229
- Numbers k such that 2*3^k - 7 is prime.at n=24A059454
- Number of ordered pairs a,b of elements in the dihedral group D_2n such that the subgroup generated by the pair a,b is the entire group D_2n.at n=46A064400
- Prime(n^2) +/- n are primes.at n=21A064495
- Number of n X n symmetric binary arrays with path of adjacent 1's from upper right corner to lower left corner.at n=4A069344
- a(n) = rad(n(n+1)(n+2)), where rad(m) is the largest squarefree number dividing m (see A007947).at n=45A078637
- Order of the following permutation on 3n+1 symbols. Write the 3n+1 symbols horizontally into a 3-column grid and read them off vertically, i.e., column after column.at n=48A119980
- Row sums of A123539.at n=22A123540
- Numbers n such that n^3 is zeroless pandigital.at n=27A124628
- Numbers m such that A119029(m) = numerator(Sum_{k=1..m} m^(k-1)/k!) is prime.at n=12A129977
- Trajectory of 13 under map n -> A132948(n).at n=20A132946
- Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.at n=31A180794
- Number of strings of numbers x(i=1..4) in 0..n with sum i^2*x(i) equal to n*16.at n=45A183955