6482
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11136
- Proper Divisor Sum (Aliquot Sum)
- 4654
- 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
- 2772
- Möbius Function
- -1
- Radical
- 6482
- Omega Function (Ω)
- 3
- 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
- 168
- 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
- Coordination sequence for CaF2(1), F position.at n=27A009924
- Coordination sequence for CaF2(2), F position.at n=36A009925
- a(0) = 1, a(n) = 5*n^2 + 2 for n>0.at n=36A010001
- a(0) = 1, a(n) = 20*n^2 + 2 for n>0.at n=18A010010
- Nine iterations of Reverse and Add are needed to reach a palindrome.at n=40A015990
- T(n, 2*n-3), T given by A027960.at n=31A027965
- "BHK" (reversible, identity, unlabeled) transform of 2,2,2,2,...at n=8A032096
- Functions of n points with no symmetries.at n=11A032176
- Convolution triangle of A000129(n) (Pell numbers).at n=49A054456
- Numbers which need nine 'Reverse and Add' steps to reach a palindrome.at n=39A065214
- Fourth convolution of A000129(n+1) (generalized (2,1)-Fibonacci, called Pell numbers), n>=0, with itself.at n=5A073381
- a(n) = (n^3 + 6n^2 - n + 12)/6.at n=32A074742
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, 0, 1), (0, 1, 0), (1, -1, 0), (1, 1, -1)}.at n=7A150220
- The count of primes between the (2n-1)-st and (2n)-th amicable number.at n=45A163647
- a(n) = n*(2*n^2 + 5*n + 1).at n=14A163832
- Number of binary strings of length n with no substrings equal to 0000, 0010, or 0100.at n=15A164417
- A symmetrical triangle based on Narayana numbers and Eulerian numbers of type B: T(n, k) = 2 + A060187(n, k) - 2*binomial(n, k)*binomial(n+1, k)/(k+1).at n=37A176291
- A symmetrical triangle based on Narayana numbers and Eulerian numbers of type B: T(n, k) = 2 + A060187(n, k) - 2*binomial(n, k)*binomial(n+1, k)/(k+1).at n=43A176291
- a(n) = n*(17*n - 13)/2.at n=28A180232
- Triangle of coefficients of polynomials v(n,x) jointly generated with A209139; see the Formula section.at n=42A209140