6355
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 8064
- Proper Divisor Sum (Aliquot Sum)
- 1709
- 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
- 4800
- Möbius Function
- -1
- Radical
- 6355
- 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
- 54
- 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
- no
- Odd
- yes
Appears in sequences
- Divisors of 2^20 - 1.at n=33A003529
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=28A026054
- Sums of six consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2 + (n+5)^2.at n=30A027865
- Number of 4-block ordered tricoverings of an unlabeled n-set.at n=29A060488
- Numbers n such that n and n+1 both are members of A074997; i.e., on the one hand n-1 and n+1 have the same prime signature, on the other hand n and n+2 have the same prime signature.at n=36A086540
- Number of different values taken by the permanent of a real nonsingular (0,1)-matrix of order n.at n=7A089475
- a(n)=2*(4^n-1)/denominator(B(2n)) where B(k) denotes the k-th Bernoulli number.at n=10A090648
- Frequency of the hexadecimal 2 in the first 10^n hexadecimal digits of Pi.at n=4A099335
- Indices of primes in sequence defined by A(0) = 69, A(n) = 10*A(n-1) - 31 for n > 0.at n=12A101534
- Numbers n such that 101101 * 10^n + 1 is prime.at n=15A106745
- Numbers n such that A001414(n) is a golden semiprime, where A001414 is the sum of primes dividing n (with repetition).at n=43A108219
- Numbers k > 0 such that (10's complement factorial of k) + 1 is prime.at n=21A109616
- Numbers n such that the last 9 decimal digits of the n-th Fibonacci number is pandigital 1-9.at n=3A112371
- Related to enumeration of rooted catapolyoctagons (see Cyvin reference for precise definition).at n=5A121115
- Numbers k such that k^2 divides 16^k-1.at n=39A128396
- 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, -1), (-1, -1, 1), (-1, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=8A148903
- 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, 0), (1, -1, 0), (1, -1, 1), (1, 0, 1), (1, 1, -1)}.at n=8A148982
- Number of walks within N^2 (the first quadrant of Z^2) starting and ending at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 0), (-1, 1), (0, -1), (1, 0)}.at n=11A151348
- Number of binary strings of length n with no substrings equal to 0010 0110 or 1100.at n=13A164498
- n such that the Moebius function take successively, from n, the values -1,0,-1,0,-1,0.at n=26A172354