6913
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
- 7168
- Proper Divisor Sum (Aliquot Sum)
- 255
- 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
- 6660
- Möbius Function
- 1
- Radical
- 6913
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 44
- 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
- From fundamental unit of Z[ (-d)^{1/4} ], where d runs over positive integers not of the form 4*k^4.at n=30A006828
- Least m such that if r and s in {1/1, 1/4, 1/9,..., 1/n^2} satisfy r < s, then r < k/m < s for some integer k.at n=26A024827
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 54 ones.at n=12A031822
- Numbers k > 1 such that k mod ord2(k) is even, where ord2(k) is the order of 2 mod k.at n=9A036260
- Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5) and cn(2,5) <= cn(1,5) and cn(2,5) <= cn(4,5)).at n=47A036811
- a(n) = 3*n*2^(n-1) + 1.at n=9A048474
- Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.at n=20A060879
- Numbers m such that the positive values of m - A002110(k) are all primes (k > 0).at n=32A068372
- Floor of concatenation of n, n+1, n+2, n+3, n+4 divided by 5.at n=3A074995
- Schroeder pseudoprimes: Composites k that divide the k-th Schroeder number A001003(k-1).at n=16A075764
- a(n) is the smallest k such that number of non-unitary prime divisors of central binomial coefficient, A001405(k) = C(k, floor(k/2)) equals n.at n=16A081394
- Smallest positive number that requires n iterations of f(k) to reach a single digit, where f(k) is the product of the two numbers formed from the alternating digits of k.at n=12A087473
- Numbers which are the sum of three positive cubes and divisible by 31.at n=34A104054
- Numbers k such that the k-th semiprime == 9 (mod k).at n=11A106134
- Number of spiro bicyclic skeletons with n carbon atoms.at n=7A107278
- Pierpont semiprimes: semiprimes of the form (2^K)*(3^L)+1.at n=25A113432
- Semiprimes in A056107.at n=12A113525
- Row sums of triangle A129503.at n=30A129504
- Weak Goodstein sequence starting at 11.at n=29A137411
- 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), (-1, 1, 1), (1, 0, -1), (1, 0, 1), (1, 1, -1)}.at n=7A149756