13892
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 25536
- Proper Divisor Sum (Aliquot Sum)
- 11644
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6600
- Möbius Function
- 0
- Radical
- 6946
- Omega Function (Ω)
- 4
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 107
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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 that are the sum of 7 nonzero 8th powers.at n=18A003385
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=30A050055
- Indices of primes in sequence defined by A(0) = 73, A(n) = 10*A(n-1) + 53 for n > 0.at n=8A101151
- Number of nondecreasing arrangements of n+2 numbers in 0..3 with each number being the sum mod 4 of two others.at n=39A183906
- Somos-4 variation with periodic coefficients.at n=10A185160
- Position of 2^n in A051037 (5-smooth numbers).at n=65A188425
- a(n) = n^4 + 3*n^3 + 8*n^2 + 9*n + 2.at n=10A270868
- a(0) = a(1) = 1; for n > 1, a(n) = Sum_{k=0..n-2} a(k) OR a(n-k-2).at n=16A318621
- Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k and with sum of digits of k = n, or 0 if no such k exists.at n=22A333666
- Number of perfect-power divisors of n!.at n=34A336416
- a(0) = 1; a(n) = Sum_{k=0..floor(n/3)} binomial(n-2*k,k) * a(k).at n=23A352039
- Expansion of (1 + 3*x) / ((1 - 2*x)*sqrt(1 - 4*x)).at n=7A372611