6463
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 6768
- Proper Divisor Sum (Aliquot Sum)
- 305
- 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
- 6160
- Möbius Function
- 1
- Radical
- 6463
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 168
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence for MgNi2, Position Mg2.at n=20A009935
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 79.at n=24A031577
- Lucky numbers with size of gaps equal to 16 (upper terms).at n=20A031899
- Prime(n) divides F(n)-1 where F(n) are the Fibonacci numbers.at n=5A071777
- Numbers m such that A076644(m) = floor((2/3)*m*(sqrt(m)+1)).at n=24A076660
- Numerical equivalents of the words zero, one, two, three, ... on touch-tone telephone.at n=9A079048
- Numbers n such that prime(n) == -9 (mod n).at n=12A092051
- One-seventh of the difference of squares of legs of primitive Pythagorean triangles, neither of which is a multiple of 7.at n=30A127924
- Numbers k such that A136675(k) is prime.at n=26A136683
- 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, -1, 0), (-1, 0, 0), (0, 0, 1), (1, 0, -1), (1, 1, 0)}.at n=7A150403
- n-th prime*8-7 is the square of a prime.at n=31A169583
- G.f.: exp( Sum_{n>=1} A119616(n)*x^n/n ) where A119616(n) = (sigma(n)^2 - sigma(n,2))/2.at n=23A201825
- Number of zero-sum -n..n arrays of 4 elements with first and second differences also in -n..n.at n=17A201875
- Lengths of binary representations of prime Fibonacci numbers.at n=24A215367
- Number of nX7 0..3 arrays with no more than floor(nX7/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=2A222678
- T(n,k)=Number of nXk 0..3 arrays with no more than floor(nXk/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=38A222679
- Number of 3Xn 0..3 arrays with no more than floor(3Xn/2) elements unequal to at least one horizontal, diagonal or antidiagonal neighbor, with new values introduced in row major 0..3 order.at n=6A222681
- Numbers k such that prime(k) divides 2^(k-1) + 1.at n=5A226018
- Positions where distinct new values of A246271 appear for the first time.at n=15A246167
- a(n) = the smallest starting value for k such that n will be the exact number of additional iterations of A003961 needed when we start from A003961(k) before we first reach a number of the form 4k+1; the least k such that A246271(k) = n.at n=12A246280