13798
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 20700
- Proper Divisor Sum (Aliquot Sum)
- 6902
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6898
- Möbius Function
- 1
- Radical
- 13798
- 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
- 151
- 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
- yes
- Odd
- no
Appears in sequences
- Definition (1): Number of n-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed.at n=19A000013
- a(n) is the number of distinct (infinite) output sequences from binary n-stage shift register which feeds back the complement of the last stage.at n=19A000016
- Number of 3's in n-th term of A006711.at n=39A022479
- Bisection of A000016 (also of A000013).at n=9A026119
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 70 ones.at n=19A031838
- Number of partitions of n into parts not of the form 21k, 21k+6 or 21k-6. Also number of partitions with at most 5 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=36A035984
- Number of ordered rooted trees with n non-root nodes and all outdegrees <= four.at n=10A036766
- a(n) = Sum_{ d divides n } phi(d)*2^(n/d)/(2n).at n=16A053634
- a(n) = ceiling(2^(n-1)/n).at n=18A053637
- Number of cyclic graphs with oriented edges on n nodes (up to symmetry of dihedral group).at n=18A053656
- Numbers which have more different digits than their cubes.at n=1A061374
- Consecutive terms of A065966 which are also consecutive integers.at n=27A065976
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 19.at n=18A068040
- Partial sum of irregular primes A000928.at n=37A132360
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7, 16*k-15 and 32*k-31 are also products of two distinct primes.at n=22A177214
- Numbers k that are the products of two distinct primes such that 2*k-1, 4*k-3, 8*k-7, 16*k-15, 32*k-31 and 64*k-63 are also products of two distinct primes.at n=8A177215
- Number of partitions of n having no parts with multiplicity 7.at n=35A184642
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and 2w^3<x^3+y^3.at n=28A211801
- Number T(n,k) of equivalence classes of ways of placing k 3 X 3 tiles in an n X 8 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=3, 0<=k<=2*floor(n/3), read by rows.at n=49A238558
- Number of n X 2 0..3 arrays with no element equal to the same number of vertical neighbors as horizontal neighbors, with new values 0..3 introduced in row major order.at n=7A241345