13825
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 19840
- Proper Divisor Sum (Aliquot Sum)
- 6015
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9360
- Möbius Function
- 0
- Radical
- 2765
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 89
- 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
- no
- Odd
- yes
Appears in sequences
- a(n) = n^3 + 1.at n=25A001093
- Number of 2-factors in C_4 X P_n.at n=5A003698
- sec(tanh(x)*cos(x))=1+1/2!*x^2-15/4!*x^4+57/6!*x^6+13825/8!*x^8...at n=4A012691
- a(n) = (n!)^3 + 1.at n=4A019514
- Pseudoprimes to base 24.at n=41A020152
- Strong pseudoprimes to base 24.at n=10A020250
- Decimal part of cube root of a(n) starts with 0: first term of runs (cubes excluded).at n=22A034126
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15.at n=18A034858
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15 for n >= 3; a(1)=1, a(2)=10.at n=19A034859
- a(n) = T(5,n), array T given by A048472.at n=9A048477
- Number of symmetric 4 X 4 matrices of nonnegative integers with every row and column adding to n.at n=8A053493
- Total number of prime power parts in all partitions of n.at n=26A073335
- Positive integers making n^2*(n-1)*(2*n-1)^2*(7*n-1)/36 a square.at n=4A073352
- Convolution of A073145 with A056594.at n=29A075419
- a(n) = 512*n + 1.at n=27A076338
- "Orderly" Friedman numbers (or "good" or "nice" Friedman numbers): Friedman numbers (A036057) where the construction digits are used in the proper order.at n=17A080035
- Triangle read by rows: T(n,k) = number of functions from an n-element set into but not onto a k-element set.at n=19A101030
- The sum of a triangular array made from a negative 6 fold permutation product with shifts up and down of {2,6}.at n=41A105162
- Pierpont 4-almost primes: numbers with exactly 4 prime divisors, not necessarily distinct, of the form 2^K*3^L + 1.at n=1A111344
- a(n) = 104*n + 9977.at n=37A126978