13822
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 6914
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6910
- Möbius Function
- 1
- Radical
- 13822
- 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
- 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
- Numbers whose sum of divisors is a fourth power.at n=37A019422
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 80 ones.at n=7A031848
- Numbers in which all pairs of consecutive base-5 digits differ by 2.at n=44A033083
- Consider all integer triples (i,j,k), j,k>0, with binomial(i+2, 3) = binomial(j+2, 3) + k^3, ordered by increasing i; sequence gives j values.at n=41A054222
- Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits.at n=32A131367
- Friedman numbers n such that n+1 is also a Friedman number.at n=25A195420
- Numbers n such that there is an integer k with the property that k^tau(n) = sigma(n).at n=10A225239
- Number of Gram blocks [g(j), g(j+3)) up to 10^n with 0 <= j < 10^n.at n=3A231159
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 865", based on the 5-celled von Neumann neighborhood.at n=22A273701
- Number of integer partitions of n whose length (number of parts) is equal to the sum of some submultiset.at n=35A367212